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.

Previous Showing 11-13 of 13 results.

A200460 Number of -n..n arrays x(0..7) of 8 elements with zero sum and nonzero first and second differences.

Original entry on oeis.org

22, 5478, 103726, 820650, 4062384, 14923636, 44716536, 115516220, 266427776, 562116652, 1103746930, 2042412926, 3596047852, 6069519806, 9877920686, 15574753386, 23883962076, 35735712652, 52308828350, 75077488038
Offset: 1

Views

Author

R. H. Hardin Nov 18 2011

Keywords

Comments

Row 6 of A200454

Examples

			Some solutions for n=3
.-3...-1...-1....2...-1....2...-2....1....0....3....2....2....3....2....2...-2
..3....1....2...-2...-2...-3....0....3....3....1....0...-3...-1...-1....0...-3
.-1...-1....0....1....3...-1....1....2....1....2...-1....2...-3...-3....3....3
.-3....2....2...-2...-3....3...-3....0...-3...-1....1...-2....0....3...-3...-2
..3...-3....0....2....2....2....3...-1....3...-3...-3....1...-1....2....1....1
..1....3....1...-1...-1...-3....1....0....1...-1...-2....0....3...-2....0...-2
.-3...-2...-3....3....3...-2....3...-2...-2....0....3....1....2....1...-3....2
..3....1...-1...-3...-1....2...-3...-3...-3...-1....0...-1...-3...-2....0....3

Links

A200461 Number of -n..n arrays x(0..8) of 9 elements with zero sum and nonzero first and second differences.

Original entry on oeis.org

34, 18692, 548204, 5876818, 36725772, 163058296, 572857272, 1697721154, 4418429664, 10383073842, 22471124198, 45437973772, 86792210440, 157952348940, 275717978586, 464147942094, 756885155284, 1199972729134, 1855294240358
Offset: 1

Views

Author

R. H. Hardin Nov 18 2011

Keywords

Comments

Row 7 of A200454

Examples

			Some solutions for n=3
..1...-3...-3...-3....0...-3...-3....1....0....1....0....0...-3...-3...-3....0
.-3...-1....0...-1....1....1....0....0...-3....0...-3...-3....1....1....1...-3
..1....3...-1...-2...-3...-2....1...-3....2....2....2....2...-3....2....2....1
.-3...-1....3....3....2....1...-3...-2....1...-2...-2...-3....0....0....0....3
..2....1....0...-2....0....3....1....3....2...-1...-3....1...-1....2...-3...-3
..3....0....2...-1...-3....2....3....2...-1....1....3...-3....2....3...-2....2
.-1....2....3....3....1...-1....0...-3...-2...-1....2....1....3....0....3...-2
.-2....1...-3....0....2...-2...-1....3...-1....1....3....3....1...-2....2...-1
..2...-2...-1....3....0....1....2...-1....2...-1...-2....2....0...-3....0....3

Links

A200455 Number of -n..n arrays x(0..2) of 3 elements with zero sum and nonzero first and second differences.

Original entry on oeis.org

4, 10, 26, 44, 72, 102, 142, 184, 236, 290, 354, 420, 496, 574, 662, 752, 852, 954, 1066, 1180, 1304, 1430, 1566, 1704, 1852, 2002, 2162, 2324, 2496, 2670, 2854, 3040, 3236, 3434, 3642, 3852, 4072, 4294, 4526, 4760, 5004, 5250, 5506, 5764, 6032, 6302, 6582
Offset: 1

Views

Author

R. H. Hardin Nov 18 2011

Keywords

Comments

Row 1 of A200454

Examples

			Some solutions for n=3
..0...-3....2....0....1....3....3...-3...-1....2...-3...-1....2....0...-2....1
..3....1....1....2...-3...-1...-2....3....2...-3....2...-2...-2...-2....2....2
.-3....2...-3...-2....2...-2...-1....0...-1....1....1....3....0....2....0...-3

Formula

Empirical: a(n) = 2*a(n-1) -2*a(n-3) +a(n-4)
Previous Showing 11-13 of 13 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.