OFFSET
0,2
COMMENTS
Pascal triangles modulo p with p prime have the dimension D = log(p*(p+1)/2)/log(p). [Corrected by Connor Lane, Nov 28 2022]
Also number of ones in row n of triangle A254609. - Reinhard Zumkeller, Feb 04 2015
LINKS
Alois P. Heinz, Table of n, a(n) for n = 0..10000
Hsien-Kuei Hwang, Svante Janson, and Tsung-Hsi Tsai, Periodic minimum in the count of binomial coefficients not divisible by a prime, arXiv:2408.06817 [math.NT], 2024.
FORMULA
EXAMPLE
n = 32 = 112|_5: b(32,1) = 2, b(32,2) = 1, thus a(32) = 2^2 * 3^1 = 12.
MAPLE
a:= proc(n) local l, m, t;
m:= n;
l:= [0$5];
while m>0 do t:= irem(m, 5, 'm')+1; l[t]:=l[t]+1 od;
mul(r^l[r], r=2..5)
end:
seq(a(n), n=0..100);
MATHEMATICA
Nest[Join[#, 2#, 3#, 4#, 5#]&, {1}, 4] (* Jean-François Alcover, Apr 12 2017, after code by Robert G. Wilson v in A006047 *)
Table[Times@@(IntegerDigits[n, 5]+1), {n, 0, 80}] (* Vincenzo Librandi, Feb 21 2026 *)
PROG
(Haskell)
a194459 = sum . map (signum . flip mod 5) . a007318_row
-- Reinhard Zumkeller, Feb 04 2015
(Python)
from math import prod
from sympy.ntheory import digits
def A194459(n):
s = digits(n, 5)[1:]
return prod((d+1)**s.count(d) for d in range(1, 5)) # Chai Wah Wu, Jul 23 2025
(Magma) [&*[ d+1 : d in (n eq 0 select [0] else IntegerToSequence(n, 5))] : n in [0..70]]; // Vincenzo Librandi, Feb 21 2026
CROSSREFS
KEYWORD
nonn,look
AUTHOR
Paul Weisenhorn, Aug 24 2011
EXTENSIONS
Edited by Alois P. Heinz, Sep 06 2011
STATUS
approved
