login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A092080 Concatenation of sequences of partition numbers A000041. 2
1, 1, 2, 1, 2, 3, 1, 2, 3, 5, 1, 2, 3, 5, 7, 1, 2, 3, 5, 7, 11, 1, 2, 3, 5, 7, 11, 15, 1, 2, 3, 5, 7, 11, 15, 22, 1, 2, 3, 5, 7, 11, 15, 22, 30, 1, 2, 3, 5, 7, 11, 15, 22, 30, 42, 1, 2, 3, 5, 7, 11, 15, 22, 30, 42, 56, 1, 2, 3, 5, 7, 11, 15, 22, 30, 42, 56, 77, 1, 2, 3, 5, 7, 11, 15, 22, 30, 42 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

COMMENTS

Sequence of row lenths of array A092078.

FORMULA

a(n)= p(m)= A000041(m) (number of partitions of m) with m := n-T, where T is the largest number from A000217 (triangular numbers) which is less than n.

EXAMPLE

a(17)= p(2)= 2 because 17 = (15=A000217(5)) + 2.

a(10)= p(4)= 5 because 10 = (6=A000217(3)) + 4 (note that T < n, not <=n, is asked for).

CROSSREFS

Sequence in context: A066657 A119444 A060040 * A193588 A165884 A136311

Adjacent sequences:  A092077 A092078 A092079 * A092081 A092082 A092083

KEYWORD

nonn,easy

AUTHOR

Wolfdieter Lang (wolfdieter.lang_AT_physik_DOT_uni-karlsruhe_DOT_de), Mar 19 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 23:53 EST 2012. Contains 205860 sequences.