|
| |
|
|
A008338
|
|
a(n+1) = a(n)/n! if n! divides a(n) else a(n)*n!.
|
|
2
|
|
|
|
1, 1, 2, 12, 288, 34560, 48, 241920, 6, 2177280, 7900913664000, 315379190543155200000, 658409472000, 4099929477061017600000, 47029248000, 61498942155915264000000, 2939328000, 1045482016650559488000000, 163296000
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,3
|
|
|
LINKS
|
Harvey P. Dale, Table of n, a(n) for n = 1..190
R. K. Guy and R. J. Nowakowski, Monthly unsolved problems, 1969-1995, Amer. Math. Monthly, 102 (1995), 921-926.
|
|
|
MAPLE
|
A008338 := proc(n) option remember; if n = 1 then 1 elif A008338(n-1) mod (n-1)! = 0 then A008338(n-1)/(n-1)! else A008338(n-1)*(n-1)!; fi; end;
|
|
|
MATHEMATICA
|
a[1] := 1; a[n_] := If[IntegerQ[a[n - 1]/(n - 1)! ], a[n - 1]/(n - 1)!, a[n - 1]*(n - 1)! ]; Table[a[n], {n, 1, 20}] (* Stefan Steinerberger, Apr 08 2006 *)
Transpose[NestList[{First[#]+1, If[Divisible[Last[#], First[#]!], Last[#]/First[#]!, Last[#]First[#]!]}&, {1, 1}, 20]][[2]] (* Harvey P. Dale, Oct 24 2011 *)
|
|
|
CROSSREFS
|
Sequence in context: A176037 A057170 A200564 * A000178 A108395 A009669
Adjacent sequences: A008335 A008336 A008337 * A008339 A008340 A008341
|
|
|
KEYWORD
|
nonn,easy,nice
|
|
|
AUTHOR
|
N. J. A. Sloane
|
|
|
EXTENSIONS
|
More terms from Stefan Steinerberger, Apr 08 2006
|
|
|
STATUS
|
approved
|
| |
|
|
