Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Revision History for A081705

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
k-tuple abundance of abundant numbers.
(history; published version)
#16 by R. J. Mathar at Wed Oct 11 06:56:44 EDT 2017
STATUS

editing

approved

#15 by R. J. Mathar at Wed Oct 11 06:56:26 EDT 2017
MAPLE

A005101 := proc(n) option remember ; local a ; if n =1 then RETURN(12) ; else a := A005101(n-1)+1 ; while numtheory[sigma](a) <= 2*a do a := a+1 ; od ; RETURN(a) ; fi ; end: 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: A081705 := proc(n) aliqRis(A005101(n)) ; end: for n from 1 to 100 do printf("%d, ", A081705(n)) ; od ; # _R. J. Mathar_, Mar 07 2007

end proc:

A081705 := proc(n)

aliqRis(A005101(n)) ;

end proc:

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

STATUS

approved

editing

#14 by Jon E. Schoenfield at Fri Aug 07 03:09:58 EDT 2015
STATUS

editing

approved

#13 by Jon E. Schoenfield at Fri Aug 07 03:09:54 EDT 2015
MAPLE

A005101 := proc(n) option remember ; local a ; if n =1 then RETURN(12) ; else a := A005101(n-1)+1 ; while numtheory[sigma](a) <= 2*a do a := a+1 ; od ; RETURN(a) ; fi ; end: 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: A081705 := proc(n) aliqRis(A005101(n)) ; end: for n from 1 to 100 do printf("%d, ", A081705(n)) ; od ; - _# _R. J. Mathar_, Mar 07 2007

STATUS

approved

editing

#12 by Bruno Berselli at Thu Oct 30 11:50:17 EDT 2014
STATUS

proposed

approved

#11 by Michel Marcus at Thu Oct 30 09:05:42 EDT 2014
STATUS

editing

proposed

#10 by Michel Marcus at Thu Oct 30 09:05:36 EDT 2014
REFERENCES

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

LINKS

H. W. Lenstra, Jr., <a href="http://www.jstor.org/stable/2320042">Advanced Problems and Solutions, 6064</a>, The American Mathematical Monthly, Vol. 84, No. 7. (Aug. - Sep., 1977), p. 580.

STATUS

proposed

editing

#9 by Paolo P. Lava at Thu Oct 30 08:58:15 EDT 2014
STATUS

editing

proposed

#8 by Paolo P. Lava at Thu Oct 30 08:58:07 EDT 2014
LINKS

Paolo P. Lava, <a href="/A081705/b081705.txt">Table of n, a(n) for n = 1..275 (first 97 terms from Gabriel Cunningham)</a>

#7 by Paolo P. Lava at Thu Oct 30 08:57:06 EDT 2014
LINKS

Paolo P. Lava, <a href="/A081705/b081705.txt">Table of n, a(n) for n = 1..275</a>

STATUS

approved

editing