Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A128836
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A128836 Numbers n such that (partition number of n) == 1 modulo n. +0
2
1, 4, 7, 11, 54, 55, 115, 146, 157, 234, 239, 951, 272732, 419192, 7626972 (list; graph; listen)
OFFSET

1,2

COMMENT

No further terms up to 10^7.

Numbers n such that A093952(n) = 1.

LINKS

Eric Weisstein's World of Mathematics, Partition Function P

CROSSREFS

A000041 (partition numbers), A051177 (perfectly partitioned numbers), A093952 (partition number of n mod n), A121015 (numbers n such that (partition number of n) == 14 modulo n).

Sequence in context: A130625 A104102 A074705 this_sequence A061956 A072732 A083487

Adjacent sequences: A128833 A128834 A128835 this_sequence A128837 A128838 A128839

KEYWORD

hard,more,nonn

AUTHOR

Max Alekseyev (maxale(AT)gmail.com), Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Robert G. Wilson v (rgwv(AT)rgwv.com) and Zak Seidov (zakseidov(AT)gmail.com), Mar 28 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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research