|
Search: id:A065355
|
|
| |
|
| 1, 0, 0, 2, 14, 86, 566, 4166, 34406, 316646, 3219686, 35878886, 435046886, 5704064486, 80428314086, 1213746099686, 19521187251686, 333363035571686, 6024361885107686, 114864714882483686, 2304476522241459686
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
Note that a(n>4) == 6 (mod 10), a(n>9) == 86 (mod 100), a(n>14) == 686 (mod 1000), etc. going to == ...78892005195676406894960947443557663471079579059686; therefore the sequence begins 5, 10, 15, etc. This sequence is in fact A007845: Least positive integer k for which 5^n divides k!. - Robert G. Wilson v (rgwv(AT)rgwv.com), Nov 02 2001
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=0,...,100
|
|
MATHEMATICA
|
Table[ n! - Sum[k!, {k, 0, n - 1} ], {n, 0, 20} ]
|
|
PROGRAM
|
(PARI) { for (n=0, 100, s=sum(k=0, n-1, k!); write("b065355.txt", n, " ", n! - s) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Oct 17 2009]
|
|
CROSSREFS
|
Sequence in context: A075140 A037563 A005610 this_sequence A162478 A065892 A139183
Adjacent sequences: A065352 A065353 A065354 this_sequence A065356 A065357 A065358
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Floor van Lamoen (fvlamoen(AT)hotmail.com), Oct 31 2001
|
|
|
Search completed in 0.002 seconds
|
