Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A134706
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A134706 a(n) = n-th perfect number divided by 2^n, minus 1. +0
1
2, 6, 61, 507, 1048447, 134216703, 1073739775, 9007199250546687, 5192296858534827626278696515534847, 187072209578355573530071658285452771612302071824383 (list; graph; listen)
OFFSET

1,1

FORMULA

a(n)=(A000396(n)/(2^n)) - 1.

a(n) = A134705(n)-1. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jan 30 2008

EXAMPLE

a(3)=61 because the 3rd perfect number is 496 and 2^3=8 and (496/8)-1=61.

CROSSREFS

Cf. A000396, A133028.

Sequence in context: A077175 A139771 A129665 this_sequence A030170 A082640 A139695

Adjacent sequences: A134703 A134704 A134705 this_sequence A134707 A134708 A134709

KEYWORD

nonn

AUTHOR

Omar E. Pol (info(AT)polprimos.com), Nov 07 2007

EXTENSIONS

More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jan 30 2008

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