Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A019294
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A019294 Number (>0) of iteration of sigma (A000203) required to reach a value divisible by n when starting with n. +0
7
1, 2, 4, 2, 5, 1, 5, 2, 7, 4, 15, 3, 13, 3, 2, 2, 13, 4, 12, 5, 2, 13, 16, 2, 17, 4, 9, 1, 78, 7, 10, 4, 17, 11, 6, 5, 28, 22, 4, 7, 39, 2, 16, 16, 16, 10, 32, 5, 13, 17, 9, 3, 58, 11, 19, 5, 13, 67, 97, 2, 23, 5, 16, 2, 4, 8, 101, 21, 19, 11, 50, 4, 20, 20, 23, 14, 21, 10, 36, 5, 15 (list; graph; listen)
OFFSET

1,2

COMMENT

Let sigma_m (n) be result of applying sum-of-divisors function m times to n; let m(n) = min m such that n divides sigma_m (n); let k(n) = sigma_{m(n)}(n)/n; sequence gives m(n).

Perfect numbers require one iteration.

It is conjectured that the sequence is finite for all n.

See also the Cohen-te Reile links under A019276.

REFERENCES

Graeme L. Cohen and Herman J. J. te Riele, Iterating the sum-of-divisors function, Experimental Mathematics, 5 (1996), pp. 93-100.

LINKS

T. D. Noe, Table of n, a(n) for n=1..400

Experimental Mathematics, Home Page

FORMULA

Conjecture : lim n -> infinity Log(sum(k = 1, n, a(k)))/Log(n) = C = 1.6... - Benoit Cloitre, Aug 24 2002

EXAMPLE

If n = 9 the iteration sequence is s(9) = {9, 13, 14, 24, 60, 168, 480, 1512, 4800, 15748, 28672} and Mod[s(9), 9] = {0, 4, 5, 6, 6, 6, 3, 0, 3, 7, 7}. The first iterate which is a multiple of 9 is the 7th = 1512, so a(9) = 7. For n = 67, the 101-st iterate is the first, so a(67) = 101. Usually several iterates are divisible by the initial value. E.g. if n = 6, then 91 of the first 100 iterates are divisible by 6.

A difficult term to compute: a(461) = 557. - Dan Reble, Jun 23 2005

MATHEMATICA

f[n_, m_] := Block[{d = DivisorSigma[1, n]}, If[ Mod[d, m] == 0, 0, d]]; Table[ Length[ NestWhileList[ f[ #, n] &, n, # != 0 &]] - 1, {n, 84}] (from Robert G. Wilson v (rgwv(AT)rgwv.com), Jun 24 2005)

PROGRAM

(PARI) a(n)=if(n<0, 0, c=1; s=n; while(sigma(s)%n>0, s=sigma(s); c++); c)

CROSSREFS

Cf. A019295, A000396, records in A019276.

Sequence in context: A136620 A139548 A108445 this_sequence A057037 A076920 A020774

Adjacent sequences: A019291 A019292 A019293 this_sequence A019295 A019296 A019297

KEYWORD

nonn,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

Additional comments from Labos E. (labos(AT)ana.sote.hu), Jun 20 2001

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research