cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A254541 Number of length 3 1..(n+2) arrays with no leading partial sum equal to a prime.

Original entry on oeis.org

1, 8, 15, 40, 49, 105, 163, 253, 307, 466, 540, 768, 997, 1283, 1442, 1862, 2051, 2562, 3053, 3627, 3936, 4749, 5465, 6368, 7230, 8270, 8848, 10189, 10805, 12187, 13557, 15138, 16715, 18646, 19585, 21596, 23572, 25845, 27081, 29803, 31136, 33942, 36650
Offset: 1

Views

Author

R. H. Hardin, Feb 01 2015

Keywords

Comments

Row 3 of A254539

Examples

			Some solutions for n=4
..1....6....6....4....4....6....4....1....6....6....4....6....6....6....6....4
..5....3....4....6....5....6....2....5....4....2....5....3....3....3....6....2
..2....3....4....2....1....3....6....3....5....6....5....5....6....1....6....2