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.

A180803 T(n,k)=number of distinct solutions to sum{i=1..k}(x(2i-1)*x(2i)) == 0 (mod n), with x() in 0..n-1.

Original entry on oeis.org

1, 1, 2, 1, 4, 3, 1, 6, 8, 5, 1, 9, 21, 20, 5, 1, 12, 45, 68, 28, 8, 1, 16, 87, 205, 142, 56, 7, 1, 20, 159, 549, 620, 355, 64, 11, 1, 25, 270, 1336, 2338, 1957, 589, 122, 12, 1, 30, 435, 3000, 7770, 9383, 4507, 1250, 150, 14, 1, 36, 676, 6302, 23282, 39768, 28783, 11171
Offset: 1

Views

Author

R. H. Hardin, suggested by Max Alekseyev in the Sequence Fans Mailing List, Sep 20 2010

Keywords

Comments

Table starts
..1...1....1.....1......1.......1........1.........1..........1...........1
..2...4....6.....9.....12......16.......20........25.........30..........36
..3...8...21....45.....87.....159......270.......435........676........1011
..5..20...68...205....549....1336.....3000......6302......12502.......23616
..5..28..142...620...2338....7770....23282.....63988.....163480......392306
..8..56..355..1957...9383...39768...151473....526152....1687310.....5046199
..7..64..589..4507..28783..158242...768541...3362296...13449091....49761514
.11.122.1250.11171..85956..576277..3422978..18294610...89142751...400327073
.12.150.1946.22146.213618.1770957.12879078..83656074..492505059..2659219164
.14.218.3372.45350.518268.5103172.44111410.340334735.2376231744.15184890632