A065422 - OEIS

This site is supported by donations to The OEIS Foundation.

A065422

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); a(0) = 1.

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; refs; listen; history; internal format)

	OFFSET	`0,3`
	LINKS	`Reinhard Zumkeller, Table of n, a(n) for n = 0..1000` `Index entries for sequences related to Recaman's sequence`
	PROG	`(Haskell)` `a065422 n = a065422_list !! n` `a065422_list = 1 : 1 : f 2 1 where` `f n x = x' : f (n+1) x' where` x' \| x `mod` n == 0 = until ((> 0) . (`mod` n)) (`div` n) x `\| otherwise = x * n` `-- Reinhard Zumkeller, Oct 10 2011`
	CROSSREFS	`See A006336 for another version. Cf. A005132.` `Sequence in context: A005395 A092495 A110808 * A008336 A033643 A050211` `Adjacent sequences: A065419 A065420 A065421 * A065423 A065424 A065425`
	KEYWORD	`easy,nonn,nice`
	AUTHOR	`Naohiro Nomoto (n_nomoto(AT)yabumi.com), Nov 23 2001`
	EXTENSIONS	`Definition and offset corrected by Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 10 2011`

Content is available under The OEIS End-User License Agreement .

Last modified February 17 12:38 EST 2012. Contains 206021 sequences.