1,1

With an initial 1, may be constructed inductively in stages from the list L = {1,2,3,....} by the following sieve procedure. Stage 1. Add 1 as the first term of the sequence a(n) and strike off 1 from L. Stage n+1. Add the first (i.e. leftmost) term k of L as a new term of the sequence a(n) and strike off k, sigma(k), sigma(sigma(k)),.... from L. - Joseph L. Pe (joseph_l_pe(AT)hotmail.com), May 08 2002

This sieve is a special case of a more general sieve. Let D be a subset of N, and let f be an injection on D satisfying f(n) > n. Define the sieve process as follows: 1. Start with empty sequence S. 2. Let E = D. 2. Append the smallest element s of E to S. 3. Remove s, f(s), f(f(s)), f(f(f(s))), ... from E. 4. Go to 2. After this sieving process, S = D - f(D). To get the current sequence, take f = sigma and D = {n | n >= 2}. - Max Alekseyev (maxal(AT)cs.ucsd.edu), Aug 08 2005

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 840.

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, December 1972 [alternative scanned copy].

a(4) = 10 because there is no x < 10 whose sigma(x) = 10.

a = {}; Do[s = DivisorSigma[1, n]; a = Append[a, s], {n, 1, 115} ]; Complement[ Table[ n, {n, 1, 115} ], Union[a] ]

Sequence in context: A133508 A125969 A070240 this_sequence A100530 A055394 A078360

Adjacent sequences: A007366 A007367 A007368 this_sequence A007370 A007371 A007372

nonn

njas, Mira Bernstein, Robert G. Wilson v (rgwv(AT)rgwv.com)

More terms from David Wison