Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A027592
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A027592 Sequence satisfies T(a)=a, where T is defined below. +0
1
1, 2, 2, 4, 5, 7, 9, 12, 16, 20, 25, 32, 39, 49, 58, 73, 86, 104, 122, 147 (list; graph; listen)
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.

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: A030769 A069355 A027597 this_sequence A007209 A166239 A058661

Adjacent sequences: A027589 A027590 A027591 this_sequence A027593 A027594 A027595

KEYWORD

nonn,more,eigen

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 18 21:37 EST 2009. Contains 171024 sequences.


AT&T Labs Research