id:A092427 - OEIS Search Results

Search: id:A092427

Displaying 1-1 of 1 results found.

page 1

Least k such that k^n divides (k-1)!.

+0
1

2, 6, 12, 12, 12, 24, 24, 36, 40, 45, 48, 60, 60, 60, 72, 72, 72, 80, 80, 90, 90, 120, 120, 120, 120, 120, 120, 120, 144, 144, 144, 144, 144, 144, 144, 180, 180, 180, 180, 180, 180, 180, 180, 180, 240, 240, 240, 240, 240, 240, 240, 240, 240, 240, 240, 240, 240 (list; graph; listen)

	OFFSET	`0,1`
	COMMENT	`A061770 gives values of n such that a(n)>a(n-1)`
	FORMULA	`Does limit n ->infty a(n)/n exists?`
	PROGRAM	`(PARI) a(n)=if(n<0, 0, k=2; while((k-1)!%(k^n)>0, k++); k)`
	CROSSREFS	`Sequence in context: A130503 A074385 A057340 this_sequence A058198 A096075 A066791` `Adjacent sequences: A092424 A092425 A092426 this_sequence A092428 A092429 A092430`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 22 2004`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research