Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A133316
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A133316 Partial sums of A000161. +0
1
1, 2, 3, 3, 4, 5, 5, 5, 6, 7, 8, 8, 9, 9, 9, 10, 11, 12, 12, 13, 13, 13, 13, 15, 16, 16, 16, 17, 17, 17, 18, 18, 19, 19, 20, 21, 21, 21, 22, 23, 23, 23, 23, 24, 24, 24, 24, 25, 27, 27, 28, 29, 29, 29, 29, 29, 30, 30, 30, 31, 31, 31, 32, 34, 34, 34, 35, 35, 35, 35, 36, 37, 38, 38 (list; graph; listen)
OFFSET

1,2

COMMENT

The first time that a(n)-a(n-1) = 3 is for n = 325, since A000161(325) = 3. The first time that a(n)-a(n-1) = 4 is for n = 1105, since A000161(1105) = 4.

FORMULA

a(n) = SUM[k=1..n]Number of partitions of k into 2 squares.

CROSSREFS

Cf. A000161.

Sequence in context: A165706 A073092 A088023 this_sequence A061451 A086155 A094606

Adjacent sequences: A133313 A133314 A133315 this_sequence A133317 A133318 A133319

KEYWORD

easy,nonn

AUTHOR

Jonathan Vos Post (jvospost3(AT)gmail.com), Oct 18 2007

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research