The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A254822 Number of length n 1..(3+1) arrays with every leading partial sum divisible by 2, 3 or 5 1
 3, 10, 30, 79, 197, 496, 1262, 3476, 10400, 30718, 86549, 244255, 709450, 2051001, 5691742, 15102696, 39115080, 102078824, 275987219, 775822274, 2223250672, 6380375677, 18280341752, 52328438849, 148625082422, 414077248266 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Column 3 of A254827 LINKS R. H. Hardin, Table of n, a(n) for n = 1..210 FORMULA Empirical: a(n) = 24*a(n-8) +632*a(n-9) +5234*a(n-10) +21008*a(n-11) +50183*a(n-12) +79287*a(n-13) +87918*a(n-14) +70786*a(n-15) +42120*a(n-16) +18620*a(n-17) +6082*a(n-18) +1447*a(n-19) +246*a(n-20) +29*a(n-21) +2*a(n-22) EXAMPLE Some solutions for n=4 ..4....3....2....3....2....2....2....3....2....2....2....3....3....2....2....4 ..1....3....4....2....3....3....1....2....4....1....2....3....3....2....2....4 ..4....4....3....1....4....1....2....1....2....1....2....4....2....4....1....4 ..3....4....1....2....1....4....1....3....4....2....2....2....4....1....3....3 CROSSREFS Sequence in context: A144007 A026960 A026990 * A027256 A332360 A115515 Adjacent sequences:  A254819 A254820 A254821 * A254823 A254824 A254825 KEYWORD nonn AUTHOR R. H. Hardin, Feb 08 2015 STATUS approved

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.

Last modified November 26 11:11 EST 2022. Contains 358359 sequences. (Running on oeis4.)