login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A081705 k-tuple abundance of abundant numbers. 8
1, 1, 1, 2, 7, 1, 1, 6, 1, 5, 1, 2, 4, 1, 1, 3, 1, 3, 1, 2, 2, 1, 7, 1, 1, 1, 6, 8, 5, 3, 31, 2, 1, 30, 1, 1, 1, 28, 5, 2, 14, 4, 1, 1, 3, 1, 2, 1, 14, 4, 1, 29, 4, 1, 28, 7, 4, 5, 3, 1, 11, 2, 1, 6, 3, 12, 1, 11, 1, 1, 6, 5, 27, 18, 1, 1, 17, 1, 2, 3, 3, 1, 1, 14, 4, 4, 13, 1, 1, 12, 2, 3, 10, 1, 5, 1, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

COMMENTS

Note that only increasing steps at the beginning of an aliquot chain count toward k-tuple abundance. I wonder if there are an infinite number of k-tuply abundant numbers for all k? Another interesting question - are there any numbers that are completely abundant (that is, numbers whose aliquot chain increases forever). Though there are several numbers whose aliquot chains aren't yet fully determined, all the ones I've checked have had a finite k-tuple abundance.

Lenstra shows that there are in fact infinitely many k-tuply abundant numbers for every k > 0.

LINKS

Paolo P. Lava, Table of n, a(n) for n = 1..275 (first 97 terms from Gabriel Cunningham)

H. W. Lenstra, Jr., Advanced Problems and Solutions, 6064, The American Mathematical Monthly, Vol. 84, No. 7. (Aug. - Sep., 1977), p. 580.

FORMULA

a(n) = 0 if n is not abundant, otherwise 1 + (a(sigma(n)-n)) Note, however, that non-abundant numbers are excluded from this sequence.

a(n) = number of increasing steps at the start of the aliquot chain of A005101(n).

EXAMPLE

a(4)=2 because the 4th abundant number is 24 which has aliquot sequence 24->36->55->17->1, which has two increasing steps at the beginning.

MAPLE

aliqRis := proc(n) local r, a, an ; r := 0 ; a := n; while true do an := numtheory[sigma](a)-a ; if an > a then r := r+1 ; a := an ; else RETURN(r) ; fi ; od ;

end proc:

A081705 := proc(n)

    aliqRis(A005101(n)) ;

end proc:

seq(A081705(n), n=1..100) ; # R. J. Mathar, Mar 07 2007

CROSSREFS

Cf. A081699, A081700.

Sequence in context: A225592 A258715 A011340 * A324329 A201889 A145057

Adjacent sequences:  A081702 A081703 A081704 * A081706 A081707 A081708

KEYWORD

nonn

AUTHOR

Gabriel Cunningham (gcasey(AT)mit.edu), Apr 02 2003, Dec 15 2006

EXTENSIONS

More terms from R. J. Mathar, Mar 07 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 20 22:47 EST 2020. Contains 332086 sequences. (Running on oeis4.)