id:A085779 - OEIS Search Results

Search: id:A085779

Displaying 1-1 of 1 results found.

page 1

Smallest m such that the triangular number A000217(n) divides m!.

+0
1

1, 3, 3, 5, 5, 7, 7, 6, 6, 11, 11, 13, 13, 7, 5, 17, 17, 19, 19, 7, 11, 23, 23, 10, 13, 13, 9, 29, 29, 31, 31, 11, 17, 17, 7, 37, 37, 19, 13, 41, 41, 43, 43, 11, 23, 47, 47, 14, 14, 17, 17, 53, 53, 11, 11, 19, 29, 59, 59, 61, 61, 31, 8, 13, 13, 67, 67, 23, 23, 71, 71, 73, 73, 37, 19, 19 (list; graph; listen)

	OFFSET	`1,2`
	FORMULA	`a(n) = A002034(A000217(n)).`
	EXAMPLE	`t(4)=10 and the first factorial divisible by 10 is 5!, so a(4)=5`
	PROGRAM	`(PARI) t(n)=n*(n+1)/2 for (n=1, 50, c=1; while (c!%t(n)!=0, c++); print1(c", "))`
	CROSSREFS	`Sequence in context: A110560 A141424 A069902 this_sequence A078936 A061794 A088524` `Adjacent sequences: A085776 A085777 A085778 this_sequence A085780 A085781 A085782`
	KEYWORD	`nonn`
	AUTHOR	`Jon Perry (perry(AT)globalnet.co.uk), Jul 23 2003`
	EXTENSIONS	`Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Jun 06 2008`

page 1

Search completed in 0.002 seconds

Last modified November 25 14:49 EST 2009. Contains 167514 sequences.

AT&T Labs Research