The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A287807 Number of senary sequences of length n such that no two consecutive terms have distance 2. 0

%I #8 Jun 05 2017 16:05:45

%S 1,6,28,132,624,2952,13968,66096,312768,1480032,7003584,33141312,

%T 156826368,742110336,3511703808,16617560832,78635142144,372105487872,

%U 1760822074368,8332299518976,39428864667648,186579390892032,882903157346304,4177942598725632

%N Number of senary sequences of length n such that no two consecutive terms have distance 2.

%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (6, -6).

%F For n>2, a(n) = 6*a(n-1) - 6*a(n-2), a(1)=6, a(2)=28.

%F G.f.: (1 - 2*x^2)/(1 - 6*x + 6*x^2).

%e For n=2 the a(2)=28=36-8 sequences contain every combination except these eight: 02,20,13,31,24,42,35,53.

%t LinearRecurrence[{6, -6}, {1, 6, 28}, 40]

%o (Python)

%o def a(n):

%o .if n in [0, 1, 2]:

%o ..return [1, 6, 28][n]

%o .return 6*a(n-1)-6*a(n-2)

%Y Cf. A040000, A003945, A083318, A078057, A003946, A126358, A003946, A055099, A003947, A015448, A126473. A287804-A287819.

%K nonn,easy

%O 0,2

%A _David Nacin_, Jun 01 2017

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 8 07:10 EDT 2024. Contains 373207 sequences. (Running on oeis4.)