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!)
A254821 Number of length n 1..(2+1) arrays with every leading partial sum divisible by 2, 3 or 5 1

%I

%S 2,6,13,26,48,80,141,250,432,811,1738,3961,8538,17025,34187,72898,

%T 157026,321779,617116,1123322,1990020,3513143,6331279,11993364,

%U 24225202,51006817,107771521,224620410,465541899,968974620,2010309389,4078213843

%N Number of length n 1..(2+1) arrays with every leading partial sum divisible by 2, 3 or 5

%C Column 2 of A254827

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

%F Empirical: a(n) = a(n-10) +27*a(n-11) +273*a(n-12) +1342*a(n-13) +3706*a(n-14) +6256*a(n-15) +6799*a(n-16) +4909*a(n-17) +2383*a(n-18) +770*a(n-19) +159*a(n-20) +19*a(n-21) +a(n-22)

%e Some solutions for n=4

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

%e ..2....3....3....1....3....1....1....3....3....2....3....2....1....1....1....1

%e ..1....3....1....1....3....2....2....3....2....3....3....1....1....3....1....1

%e ..3....3....2....1....1....1....3....1....1....2....2....2....1....2....2....3

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 08 2015

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 February 4 10:00 EST 2023. Contains 360046 sequences. (Running on oeis4.)