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.

A007211 Oscillates under partition transform.

Original entry on oeis.org

1, 2, 3, 5, 6, 10, 12, 17, 22, 29, 36, 48, 58, 73, 91, 111, 134, 165, 197, 236, 283, 335, 395, 468, 547, 639, 747, 866, 1001, 1160, 1334, 1530, 1757, 2007, 2286, 2606, 2958, 3349, 3793, 4281, 4821, 5430, 6097, 6833, 7657, 8559, 9549, 10652, 11858, 13178, 14639
Offset: 1

Views

Author

Keywords

Comments

Appears to be identical to A130900.

References

  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

Extensions

More terms from Sean A. Irvine, Nov 10 2019

A027594 Sequence satisfies T^2(a)=a, where T is defined below.

Original entry on oeis.org

1, 2, 3, 4, 6, 9, 11, 15, 19, 24, 30, 39, 46, 57, 69, 82, 99, 119, 138, 163, 190, 221, 256, 298, 339, 389, 445, 505, 575, 653, 733, 827, 929, 1042, 1166, 1306, 1450, 1614, 1795, 1988, 2203, 2438, 2683, 2960, 3257, 3580, 3929, 4312, 4712, 5155, 5635, 6145, 6701
Offset: 0

Views

Author

Keywords

References

  • S. Viswanath (student, Dept. Math, Indian Inst. Technology, Kanpur) A Note on Partition Eigensequences, preprint, Nov 15 1996.

Formula

Define T:a->b by: given a1 <= a2 <= ..., let b(n) = number of ways of partitioning n into parts from a1, a2, ... such that parts = 0 mod 5 do not occur more than once.
A027594 = T(A027593). - Sean A. Irvine, Nov 10 2019

Extensions

More terms from Sean A. Irvine, Nov 09 2019
Showing 1-2 of 2 results.