OFFSET
1,2
COMMENTS
This is the analog of the sequence of Pisano periods (A001175) for binomial numbers.
n^2 always divides a(n).
A prime p is a factor of a(n) if and only if it is a factor of n (i.e., a(n) and n have the same prime factors).
If n has N distinct prime factors, then n^(N+2-2d(n)) <= a(n) <= n^(N+1), where d(n) is the sum of the reciprocals of the first n terms of Sylvester's sequence, A000058. This implies that there are distinct bands in the graph. - Hari Rajesh, Oct 12 2025
LINKS
Hari Rajesh, Table of n, a(n) for n = 1..10000 (first 111 terms from Hieronymus Fischer, apart from a(82) and a(84) that were corrected)
FORMULA
a(n) = n^2 if n is a prime or a power of a prime.
a(n) = Product_{i} p_i^(k_i+s_i), where the prime factorisation of n is Product_{i} p_i^s_i for distinct primes p_i, and k_i = floor(log_(p_i)(n)). - Hari Rajesh, Oct 12 2025
EXAMPLE
PROG
(PARI) a(n) = my(f=factor(n)); for (k=1, #f~, f[k, 2] += logint(n, f[k, 1])); factorback(f); \\ Michel Marcus, Oct 13 2025
CROSSREFS
KEYWORD
nonn,look
AUTHOR
Hieronymus Fischer, Oct 15 2007, Oct 20 2007
STATUS
approved
