id:A065422 - OEIS Search Results

Search: id:A065422

Displaying 1-1 of 1 results found.

page 1

If n|a(n) then a(n+1) = a(n)/(highest power of n that divides a(n)), otherwise a(n+1) = n*a(n).

+0
3

1, 1, 2, 6, 24, 120, 20, 140, 1120, 10080, 1008, 11088, 77, 1001, 14014, 210210, 3363360, 57177120, 1029188160, 19554575040, 977728752, 2217072, 100776, 2317848, 96577, 2414425, 62775050, 1694926350, 47457937800, 1376280196200 (list; graph; listen)

	OFFSET	`1,3`
	LINKS	`Index entries for sequences related to Recaman's sequence`
	CROSSREFS	`See A006336 for another version. Cf. A005132.` `Sequence in context: A005395 A092495 A110808 this_sequence A008336 A033643 A050211` `Adjacent sequences: A065419 A065420 A065421 this_sequence A065423 A065424 A065425`
	KEYWORD	`easy,nonn,nice`
	AUTHOR	`Naohiro Nomoto (n_nomoto(AT)yabumi.com), Nov 23 2001`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research