OFFSET
0,2
COMMENTS
a(n) is the period (mod 10) of the numbers in each column n of Pascal's triangle.
REFERENCES
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 828.
LINKS
Harvey P. Dale, Table of n, a(n) for n = 0..449
Michel Lagneau, Proof
Luis Manuel Rivera, Integer sequences and k-commuting permutations, arXiv preprint arXiv:1406.3081 [math.CO], 2014-2015.
FORMULA
a(0)=1, and a(n) = 10 * n! for n >= 1.
EXAMPLE
x(0)= 0.C(1,0)C(2,0)C(3,0) ... = 0.11111111111... and p(0)=1 ;
x(1)= 0.C(1,1)C(2,1)C(3,1) ... = 0.12345678901234... and p(1) = 10 ;
x(2)= 0.C(2,2)C(3,2)C(4,2) ... = 0.13605186556815063100 13605186556815063100... and p(2)=20.
MATHEMATICA
Join[{1}, Array[10#!&, 20]] (* Harvey P. Dale, Feb 18 2018 *)
PROG
(Python)
from math import factorial
def A174183(n): return 10*factorial(n) if n else 1 # Chai Wah Wu, Aug 07 2025
CROSSREFS
KEYWORD
nonn,easy,base
AUTHOR
Michel Lagneau, Mar 11 2010
EXTENSIONS
Additional comments, and errors in examples corrected by Michel Lagneau, May 07 2010
STATUS
approved
