The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A027597 Sequence satisfies T(a)=a, where T is defined below. 0
1, 2, 2, 4, 5, 7, 9, 12, 16, 19, 24, 30, 37, 45, 53, 66, 77, 93, 108, 129, 151, 175, 204, 237, 275, 315, 361, 416, 473, 541, 611, 698, 787, 889, 1000, 1127, 1267, 1417, 1586, 1773, 1977, 2202, 2445, 2721, 3014, 3340, 3689, 4081, 4502, 4960, 5459, 6005, 6598 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
REFERENCES
S. Viswanath (student, Dept. Math, Indian Inst. Technology, Kanpur) A Note on Partition Eigensequences, preprint, Nov 15 1996.
LINKS
M. Bernstein and N. J. A. Sloane, Some canonical sequences of integers, Linear Alg. Applications, 226-228 (1995), 57-72; erratum 320 (2000), 210. [Link to arXiv version]
M. Bernstein and N. J. A. Sloane, Some canonical sequences of integers, Linear Alg. Applications, 226-228 (1995), 57-72; erratum 320 (2000), 210. [Link to Lin. Alg. Applic. version together with omitted figures]
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.
CROSSREFS
Sequence in context: A030769 A030739 A211861 * A258318 A027592 A007209
KEYWORD
nonn,eigen
AUTHOR
EXTENSIONS
More terms from Sean A. Irvine, Nov 11 2019
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 21 19:35 EDT 2024. Contains 372738 sequences. (Running on oeis4.)