Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A056872
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A056872 Numbers n such that n | p(n) + q(n) where p(n) = partition numbers (A000041) and q(n) = partition numbers into distinct parts (A000009). +0
1
1, 5, 25, 42, 133, 618, 643, 701, 1962, 8150 (list; graph; listen)
OFFSET

1,2

MATHEMATICA

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

CROSSREFS

Cf. A000041 and A000009.

Sequence in context: A099799 A093534 A070388 this_sequence A029490 A098947 A147176

Adjacent sequences: A056869 A056870 A056871 this_sequence A056873 A056874 A056875

KEYWORD

nonn

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), Sep 02 2000

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 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research