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!)
A183908 Number of nondecreasing arrangements of n+2 numbers in 0..5 with each number being the sum mod 6 of two others. 1

%I #8 Apr 06 2018 06:21:20

%S 2,8,37,124,309,637,1163,1953,3085,4650,6753,9514,13069,17571,23191,

%T 30119,38565,48760,60957,75432,92485,112441,135651,162493,193373,

%U 228726,269017,314742,366429,424639,489967,563043,644533,735140,835605,946708

%N Number of nondecreasing arrangements of n+2 numbers in 0..5 with each number being the sum mod 6 of two others.

%C Column 5 of A183912.

%H R. H. Hardin, <a href="/A183908/b183908.txt">Table of n, a(n) for n = 1..132</a>

%F Empirical: a(n) = (1/120)*n^5 + (5/24)*n^4 + (49/24)*n^3 - (29/24)*n^2 - (461/20)*n + 43 for n>2.

%F Conjectures from _Colin Barker_, Apr 06 2018: (Start)

%F G.f.: x*(2 - 4*x + 19*x^2 - 18*x^3 - 10*x^4 + 11*x^5 + 5*x^6 - 4*x^7) / (1 - x)^6.

%F a(n) = 6*a(n-1) - 15*a(n-2) + 20*a(n-3) - 15*a(n-4) + 6*a(n-5) - a(n-6) for n>7.

%F (End)

%e All solutions for n=2:

%e ..0....0....0....2....0....1....1....0

%e ..2....0....0....2....2....2....3....3

%e ..2....3....0....4....4....3....4....3

%e ..4....3....0....4....4....5....5....3

%Y Cf. A183912.

%K nonn

%O 1,1

%A _R. H. Hardin_, Jan 07 2011

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 August 5 20:58 EDT 2024. Contains 374956 sequences. (Running on oeis4.)