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.

A183892 T(n,k)=Number of arrangements of n+3 numbers in 0..k with each number being the sum mod (k+1) of three others.

Original entry on oeis.org

8, 1, 22, 16, 121, 52, 1, 292, 631, 114, 8, 241, 2574, 2059, 240, 1, 982, 8681, 13344, 6399, 494, 16, 1, 20152, 63645, 59518, 19483, 1004, 1, 492, 32821, 201154, 363749, 250124, 58807, 2026, 8, 241, 57614, 542557, 1466628, 1905097, 1024174, 176859
Offset: 1

Views

Author

R. H. Hardin Jan 07 2011

Keywords

Comments

Table starts
....8.......1.......16..........1...........8...........1...........16
...22.....121......292........241.........982...........1..........492
...52.....631.....2574.......8681.......20152.......32821........57614
..114....2059....13344......63645......201154......542557......1172880
..240....6399....59518.....363749.....1466628.....4978219.....13388190
..494...19483...250124....1905097.....9469778....38280865....122033732
.1004...58807..1024174....9681073....58702904...277198249...1030189438
.2026..176859..4143944...48678653...357576342..1964161189...8431580544
.4072..531103.16671934..243871365..2161032260.13808869207..68127437030
.8166.1593931.66886900.1220204441.13012476622.96809981737.547474985956

Examples

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

Crossrefs

Column 1 is A005803(n+3)