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.

Showing 1-2 of 2 results.

A335691 A000166(n)^2.

Original entry on oeis.org

1, 0, 1, 4, 81, 1936, 70225, 3437316, 220017889, 17821182016, 1782120871521, 215636596084900, 31051670188655281, 5247732257301156624, 1028555522495168900401, 231424992560450869558756, 59244798095490816735545025, 17121746649596584336387952896
Offset: 0

Views

Author

N. J. A. Sloane, Jul 20 2020

Keywords

References

  • I. Kaplansky and J. Riordan, The problème des ménages, Scripta Math. 12, (1946), 113-124. See p. 115.

Crossrefs

A335693 A000904(n) - (-1)^n.

Original entry on oeis.org

0, 1, 2, 14, 82, 593, 4820, 43980, 444612, 4934721, 59661254, 780531034, 10987095718, 165586966817, 2660378564776, 45392022568024, 819716784789192, 15620010933562689, 313219935456042954, 6593238655510464742, 145364470356686267258, 3349976056859294611697
Offset: 0

Views

Author

N. J. A. Sloane, Jul 20 2020

Keywords

Comments

A000179(n) = a(n-2) - a(n-4) for n >= 2. For example A000179(6) = 80 = 82 - 2 = a(4) - a(2).

References

  • I. Kaplansky and J. Riordan, The problème des ménages, Scripta Math. 12, (1946), 113-124. See q_n.

Crossrefs

Showing 1-2 of 2 results.