id:A045997 - OEIS Search Results

Search: id:A045997

Displaying 1-1 of 1 results found.

page 1

Number of iterations required to reach stationary value when applying repeatedly applying d, the number of divisors function, to n!.

+0
1

0, 0, 0, 3, 4, 3, 5, 6, 6, 6, 4, 6, 6, 6, 6, 6, 5, 6, 6, 6, 6, 6, 7, 6, 6, 6, 6, 5, 5, 7, 5, 6, 5, 6, 7, 5, 7, 6, 4, 6, 5, 7, 5, 5, 7, 7, 7, 7, 7, 7, 5, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 7, 6, 7, 6, 7, 7, 7, 7, 7, 7, 6, 7, 7, 7, 7, 7, 7, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 7, 6, 7, 7, 7, 6, 7 (list; graph; listen)

	OFFSET	`0,4`
	PROGRAM	`(PARI:) for(x=0, 100, for(a=0, 15, if(a==0, d=x!, if(d<3, print(a-1), d=numdiv(d) ))))`
	CROSSREFS	`Sequence in context: A090739 A076400 A121889 this_sequence A058024 A021295 A061112` `Adjacent sequences: A045994 A045995 A045996 this_sequence A045998 A045999 A046000`
	KEYWORD	`nonn`
	AUTHOR	`David W. Wilson (davidwwilson(AT)comcast.net), Don McDonald (dsmc(AT)actrix.gen.nz)`

page 1

Search completed in 0.002 seconds

Last modified August 29 17:54 EDT 2008. Contains 143238 sequences.

AT&T Labs Research