login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A134665 Highest power of 2 dividing the n-th multiply perfect number A007691. 2
0, 1, 2, 3, 4, 5, 6, 5, 3, 9, 2, 9, 12, 7, 9, 8, 8, 13, 16, 7, 7, 10, 14, 13, 18, 14, 13, 11, 5, 10, 10, 8, 11, 11, 7, 7, 14, 15, 5, 9, 30, 11, 8, 17, 15, 11, 11, 14, 20, 20, 20, 15, 21, 19, 25, 19, 15, 17, 17, 17, 22, 25, 20, 25, 19, 19, 19, 27, 19, 19, 27, 17, 19, 27, 19, 21, 23, 20 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

The large terms, for example at n=41, correspond to the perfect numbers A000396 in A007691. See A134666 for the number of multiply perfect numbers having a given highest exponent of 2.

LINKS

T. D. Noe, Table of n, a(n) for n=1..5000 (using Flammenkamp's data)

Achim Flammenkamp, The Multiply Perfect Numbers Page

CROSSREFS

Sequence in context: A070667 A245349 A122416 * A271832 A063260 A271859

Adjacent sequences:  A134662 A134663 A134664 * A134666 A134667 A134668

KEYWORD

nonn

AUTHOR

T. D. Noe, Nov 05 2007

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 8 21:07 EST 2016. Contains 278957 sequences.