[go: up one dir, main page]

login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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

%I #4 Jun 06 2015 08:42:31

%S 2,6,12,20,28,36,46,56,67,73,88,95,113,131,151,160,186,196,224,250,

%T 278,290,323,354,389,422,460,476,520,536,579,622,667,712,762,781,831,

%U 881,935,957,1018,1041,1102,1160,1224,1250,1321,1386,1458,1525,1596,1625,1702

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

%C Row 2 of A258631

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

%e Some solutions for n=8

%e ..7....8....3....9....2....2....7....2....4....5....6....6....7....8....8....6

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

%Y Cf. A258631

%K nonn

%O 1,1

%A _R. H. Hardin_, Jun 06 2015