A254948 - OEIS

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

Other ways to Give

A254948

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

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 11, 12, 13, 14, 14, 15, 15, 16, 17, 18, 18, 19, 20, 21, 22, 23, 23, 24, 24, 25, 26, 27, 28, 29, 29, 30, 31, 32, 32, 33, 33, 34, 35, 36, 36, 37, 38, 39, 40, 41, 41, 42, 43, 44, 45, 46, 46, 47, 47, 48, 49, 50, 51, 52, 52, 53, 54, 55, 55, 56, 56, 57, 58, 59

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

COMMENTS

Row 1 of A254947

LINKS

R. H. Hardin, Table of n, a(n) for n = 1..210

EXAMPLE

All solutions for n=4

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

CROSSREFS

Sequence in context: A291576 A355221 A180613 * A072778 A178787 A372822

Adjacent sequences: A254945 A254946 A254947 * A254949 A254950 A254951

KEYWORD

nonn

AUTHOR

R. H. Hardin, Feb 10 2015

STATUS

approved