login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A200254 Number of 0..n arrays x(0..4) of 5 elements with each no smaller than the sum of its previous elements modulo (n+1) 2
13, 48, 181, 405, 951, 1792, 3434, 5625, 9365, 14256, 21855, 31213, 44863, 61440, 84500, 111537, 147789, 190000, 244905, 307461, 386903, 476928, 588990, 714025, 867061, 1037232, 1242451, 1468125, 1736895, 2031616, 2378792, 2756193, 3196493 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Row 5 of A200251

LINKS

R. H. Hardin, Table of n, a(n) for n = 1..210

FORMULA

Empirical: a(n) = 2*a(n-1) -2*a(n-3) +2*a(n-4) -2*a(n-5) +2*a(n-7) +a(n-8) -4*a(n-9) +4*a(n-11) -4*a(n-12) +4*a(n-13) -4*a(n-15) +a(n-16) +2*a(n-17) -2*a(n-19) +2*a(n-20) -2*a(n-21) +2*a(n-23) -a(n-24)

EXAMPLE

Some solutions for n=6

..4....5....5....1....4....1....0....0....6....2....3....1....1....4....0....2

..6....6....5....1....6....3....5....1....6....2....6....2....1....6....5....4

..4....6....6....2....4....6....5....2....6....5....3....6....5....4....5....6

..1....6....5....4....1....3....4....4....6....3....6....6....0....1....6....5

..5....3....3....3....1....6....5....1....4....5....5....5....6....6....4....4

CROSSREFS

Sequence in context: A135712 A225920 A027980 * A288746 A220707 A189349

Adjacent sequences:  A200251 A200252 A200253 * A200255 A200256 A200257

KEYWORD

nonn

AUTHOR

R. H. Hardin Nov 15 2011

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 16 08:07 EDT 2021. Contains 343940 sequences. (Running on oeis4.)