Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A007594
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A007594 Smallest n-hyperperfect number: m such that m=n(sigma(m)-m-1)+1; or 0 if no such number exists.
(Formerly M4150)
+0
1
6, 21, 325, 1950625 (list; graph; listen)
OFFSET

1,1

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

D. Minoli, Issues in non-linear hyperperfect numbers, Math. Comp., 34 (1980), 639-645.

J. Roberts, Lure of the Integers, Math. Assoc. America, 1992, p. 177.

LINKS

J. S. McCranie, A study of hyperperfect numbers, J. Int. Seqs. Vol. 3 (2000) #P00.1.3

CROSSREFS

Sequence in context: A054366 A143049 A164643 this_sequence A012858 A084539 A034124

Adjacent sequences: A007591 A007592 A007593 this_sequence A007595 A007596 A007597

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

Jud McCranie (j.mccranie(AT)comcast.net) reports that the following terms are known:

6,21,325,1950625,?,301,?,?,?,159841,10693,697,?,?,?,

69091933912976476978420033,?,1333,51301,?,?,

865004941741938633917612789573739286076451841,?,?,?,?,?

where the missing terms, if they exist, are > 10^11. The large terms for 16 and 22 are the smallest known (7/98).

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