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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A003062 Beginnings of periodic unitary aliquot sequences. (Formerly M4190) 8
 6, 30, 42, 54, 60, 66, 78, 90, 100, 102, 114, 126, 140, 148, 194, 196, 208, 220, 238, 244, 252, 274, 288, 292, 300, 336, 348, 350, 364, 374, 380, 382, 386, 388, 400, 420, 436, 440, 476, 482, 484, 492, 516, 528, 540, 542, 550, 570, 578, 592, 600, 612, 648, 660, 680, 688, 694, 708, 720, 722, 740, 756, 758, 764, 766, 770, 780, 784, 792, 794, 812 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Provided that A034460 has no infinite unbounded trajectories, these are also numbers n such that when iterating the map k -> A034460(k), starting from k = n, the iteration will never reach 0, that is, will instead eventually enter into a finite cycle. - Antti Karttunen, Sep 23 2018 REFERENCES N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). H. J. J. Te Riele, Unitary Aliquot Sequences. Report MR-139/72, Mathematisch Centrum, Amsterdam, September 1972. LINKS Antti Karttunen, Table of n, a(n) for n = 1..20000 PROG (PARI) up_to = 20000; A034460(n) = (sumdivmult(n, d, if(gcd(d, n/d)==1, d))-n); \\ From A034460 A318880(n) = { my(visited = Map()); for(j=1, oo, if(mapisdefined(visited, n), return(1), mapput(visited, n, j)); n = A034460(n); if(!n, return(0))); }; A003062list(up_to) = { my(v = vector(up_to), k=0, n=1); while(k

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.

Last modified June 19 11:45 EDT 2021. Contains 345128 sequences. (Running on oeis4.)