Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A059218
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A059218 Numbers n such that n divides the sum of the first n partition numbers (A000041) and the sum of the first n unique partition numbers (A000009). +0
1
1, 6, 10, 14, 56, 239, 623, 874, 1246, 2462, 4711, 16003, 31486, 32081, 40956 (list; graph; listen)
OFFSET

1,2

MATHEMATICA

s = 0; Do[ s = s + PartitionsP[n] + PartitionsQ[n] If[ Mod[ s, n] == 0, Print[n] ], {n, 1, 53100} ]

CROSSREFS

Cf. A000041 and A000009.

Sequence in context: A119623 A129119 A074980 this_sequence A095678 A094564 A006987

Adjacent sequences: A059215 A059216 A059217 this_sequence A059219 A059220 A059221

KEYWORD

nonn

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), Jan 18 2001

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research