cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

A134706 a(n) = n-th perfect number divided by 2^n, minus 1.

Original entry on oeis.org

2, 6, 61, 507, 1048447, 134216703, 1073739775, 9007199250546687, 5192296858534827626278696515534847, 187072209578355573530071658285452771612302071824383
Offset: 1

Views

Author

Omar E. Pol, Nov 07 2007

Keywords

Examples

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

Crossrefs

Formula

a(n)=(A000396(n)/(2^n)) - 1.
a(n) = A134705(n)-1. - R. J. Mathar, Jan 30 2008

Extensions

More terms from R. J. Mathar, Jan 30 2008
Showing 1-1 of 1 results.