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

 


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

%I #7 Sep 05 2023 16:56:53

%S 2,6,10,16,23,26,35,44,55,60,75,81,98,115,135,143,168,177,204,229,257,

%T 268,301,329,362,392,427,441,484,498,539,579,622,664,713,730,778,823,

%U 874,893,950,970,1026,1079,1138,1160,1227,1250,1317,1378,1445,1470,1545,1609

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

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

%F Empirical: a(n) = a(n-1) + 2*a(n-30) - 2*a(n-31) - a(n-60) + a(n-61).

%e All solutions for n=4:

%e ..2....2....5....5....4....5....2....4....3....3....4....3....3....4....5....2

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

%Y Row 2 of A254827.

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 08 2015

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 22 16:18 EDT 2024. Contains 376119 sequences. (Running on oeis4.)