[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”).

Revision History for A254949 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing all changes.
Number of length 2 1..(n+1) arrays with every leading partial sum divisible by 2, 3, 5, 7 or 11.
(history; published version)
#6 by Wesley Ivan Hurt at Sun May 07 17:08:57 EDT 2023
STATUS

editing

approved

#5 by Wesley Ivan Hurt at Sun May 07 17:08:51 EDT 2023
NAME

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

COMMENTS

Row 2 of A254947.

CROSSREFS

Cf. A254947.

STATUS

approved

editing

#4 by R. H. Hardin at Tue Feb 10 20:05:51 EST 2015
STATUS

editing

approved

#3 by R. H. Hardin at Tue Feb 10 20:05:48 EST 2015
LINKS

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

#2 by R. H. Hardin at Tue Feb 10 20:05:34 EST 2015
NAME

allocated for R. H. Hardin

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

DATA

2, 6, 12, 20, 30, 40, 52, 64, 76, 90, 105, 113, 132, 151, 172, 182, 208, 219, 247, 274, 303, 316, 350, 382, 417, 451, 490, 507, 551, 568, 611, 655, 701, 747, 797, 817, 868, 919, 974, 997, 1058, 1082, 1144, 1203, 1268, 1295, 1366, 1432, 1504, 1572, 1644, 1674, 1752

OFFSET

1,1

COMMENTS

Row 2 of A254947

EXAMPLE

Some solutions for n=4

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

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

KEYWORD

allocated

nonn

AUTHOR

R. H. Hardin, Feb 10 2015

STATUS

approved

editing

#1 by R. H. Hardin at Tue Feb 10 19:58:23 EST 2015
NAME

allocated for R. H. Hardin

KEYWORD

allocated

STATUS

approved