|
Search: id:A008336
|
|
|
| A008336 |
|
a(n+1) = a(n)/n if n|a(n) else a(n)*n. |
|
+0
4
|
|
| 1, 1, 2, 6, 24, 120, 20, 140, 1120, 10080, 1008, 11088, 924, 12012, 858, 12870, 205920, 3500640, 194480, 3695120, 184756, 3879876, 176358, 4056234, 97349616, 2433740400, 93605400, 2527345800
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
REFERENCES
|
R. K. Guy and R. Nowakowski, Unsolved Problems, Amer. Math. Monthly, vol. 102 (1995), circa page 924.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..1000
N. J. A. Sloane, My favorite integer sequences, in Sequences and their Applications (Proceedings of SETA '98).
Index entries for sequences related to Recaman's sequence
Nick Hobson, Python program for this sequence
|
|
MAPLE
|
A008336 := proc(n) option remember; if n = 1 then 1 elif A008336(n-1) mod (n-1) = 0 then A008336(n-1)/(n-1) else A008336(n-1)*(n-1); fi; end;
|
|
CROSSREFS
|
Cf. A005132, A065422.
Sequence in context: A092495 A110808 A065422 this_sequence A033643 A050211 A066616
Adjacent sequences: A008333 A008334 A008335 this_sequence A008337 A008338 A008339
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
B. Recaman [Recam\'{a}n].
|
|
|
Search completed in 0.002 seconds
|
