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!)
A269437 Number of length-5 0..n arrays with no repeated value greater than the previous repeated value. 1

%I #8 Jan 22 2019 07:46:33

%S 28,222,964,2995,7536,16408,32152,58149,98740,159346,246588,368407,

%T 534184,754860,1043056,1413193,1881612,2466694,3188980,4071291,

%U 5138848,6419392,7943304,9743725,11856676,14321178,17179372,20476639,24261720

%N Number of length-5 0..n arrays with no repeated value greater than the previous repeated value.

%H R. H. Hardin, <a href="/A269437/b269437.txt">Table of n, a(n) for n = 1..210</a>

%F Empirical: a(n) = n^5 + 5*n^4 + (17/2)*n^3 + 8*n^2 + (9/2)*n + 1.

%F Conjectures from _Colin Barker_, Jan 22 2019: (Start)

%F G.f.: x*(28 + 54*x + 52*x^2 - 19*x^3 + 6*x^4 - x^5) / (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>6.

%F (End)

%e Some solutions for n=8:

%e ..2. .3. .5. .5. .2. .7. .6. .3. .8. .3. .7. .2. .1. .8. .6. .8

%e ..1. .4. .4. .3. .3. .4. .4. .4. .7. .5. .1. .2. .1. .1. .6. .2

%e ..5. .0. .6. .4. .2. .8. .6. .0. .2. .0. .5. .4. .1. .0. .1. .7

%e ..0. .2. .7. .6. .4. .4. .1. .0. .4. .7. .8. .3. .4. .3. .7. .4

%e ..3. .3. .4. .7. .5. .1. .7. .3. .5. .3. .0. .4. .0. .6. .5. .8

%Y Row 5 of A269435.

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 26 2016

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 April 23 23:26 EDT 2024. Contains 371917 sequences. (Running on oeis4.)