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.

A200454 T(n,k)=Number of -k..k arrays x(0..n+1) of n+2 elements with zero sum and nonzero first and second differences.

Original entry on oeis.org

4, 10, 4, 26, 44, 6, 44, 142, 144, 10, 72, 342, 728, 486, 14, 102, 678, 2334, 3788, 1582, 22, 142, 1148, 5720, 16380, 19802, 5478, 34, 184, 1832, 12002, 50852, 115140, 103726, 18692, 52, 236, 2744, 22276, 127988, 451708, 820650, 548204, 64782, 80, 290, 3874
Offset: 1

Views

Author

R. H. Hardin Nov 18 2011

Keywords

Comments

Table starts
...4.....10.......26.........44..........72..........102...........142
...4.....44......142........342.........678.........1148..........1832
...6....144......728.......2334........5720........12002.........22276
..10....486.....3788......16380.......50852.......127988........278906
..14...1582....19802.....115140......451708......1375006.......3513884
..22...5478...103726.....820650.....4062384.....14923636......44716536
..34..18692...548204....5876818....36725772....163058296.....572857272
..52..64782..2916664...42324384...334032710...1791564880....7380022092
..80.223272.15576706..306098316..3050654456..19771609900...95496980144
.126.776430.83481240.2222013090.27965763262.219008350922.1240352594210

Examples

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

Crossrefs

Column 1 is twice A077419(n+2)