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!)
A027592 Sequence satisfies T(a)=a, where T is defined below. 0
1, 2, 2, 4, 5, 7, 9, 12, 16, 20, 25, 32, 39, 49, 58, 73, 86, 104, 122, 147, 173, 203, 236, 276, 321, 371, 426, 491, 562, 643, 729, 833, 941, 1067, 1199, 1355, 1521, 1705, 1907, 2132, 2381, 2649, 2942, 3269, 3622, 4012, 4426, 4893, 5390, 5937, 6522, 7168, 7864 (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 3 do not occur more than once.
CROSSREFS
Sequence in context: A211861 A027597 A258318 * A007209 A240215 A166239
KEYWORD
nonn,eigen
AUTHOR
EXTENSIONS
More terms from Sean A. Irvine, Nov 09 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 April 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)