OFFSET
1,2
COMMENTS
By a result of Karhumaki and Lifshits, this is also the number of polynomials p(x) with coefficients in {0,1} that divide x^n-1 and such that (x^n-1)/ {(x-1)p(x)} has all coefficients in {0,1}.
The number of tiles of a discrete interval of length n (an interval of Z). - Eric H. Rivals (rivals(AT)lirmm.fr), Mar 13 2007
Bodini and Rivals proved this is the number of tiles of a discrete interval of length n and also is the number (A107067) of polynomials p(x) with coefficients in {0,1} that divide x^n-1 and such that (x^n-1)/ {(x-1)p(x)} has all coefficients in {0,1} (Bodini, Rivals, 2006). This structure of such tiles is also known as Krasner's factorization (Krasner and Ranulac, 1937). The proof also gives an algorithm to recognize if a set is a tile in optimal time and in this case, to compute the smallest interval it can tile (Bodini, Rivals, 2006). - Eric H. Rivals (rivals(AT)lirmm.fr), Mar 13 2007
Number of lone-child-avoiding rooted achiral (or generalized Bethe) trees with positive integer leaves summing to n, where a rooted tree is lone-child-avoiding if all terminal subtrees have at least two branches, and achiral if all branches directly under any given node are equal. For example, the a(6) = 6 trees are 6, (111111), (222), ((11)(11)(11)), (33), ((111)(111)). - Gus Wiseman, Jul 13 2018. Updated Aug 22 2020.
From Gus Wiseman, Aug 20 2020: (Start)
Also the number of strict chains of divisors starting with n. For example, the a(n) chains for n = 1, 2, 4, 6, 8, 12 are:
1 2 4 6 8 12
2/1 4/1 6/1 8/1 12/1
4/2 6/2 8/2 12/2
4/2/1 6/3 8/4 12/3
6/2/1 8/2/1 12/4
6/3/1 8/4/1 12/6
8/4/2 12/2/1
8/4/2/1 12/3/1
12/4/1
12/4/2
12/6/1
12/6/2
12/6/3
12/4/2/1
12/6/2/1
12/6/3/1
(End)
a(n) is the number of chains including n of the divisor lattice of divisors of n, which is to say, a(n) is the number of (d_1,d_2,...,d_k) such that d_1 < d_2 < ... < d_k = n and d_i divides d_{i+1} for 1 <= i <= k-1. Using this definition, the recurrence a(n) = 1 + Sum_{0 < d < n, d|n} a(d) is evident by enumerating the preceding element of n in the chains. If we count instead the chains whose LCM of members is n, then a(1) would be 2 because the empty chain is included, and we would obtain 2*A074206(n). - Jianing Song, Aug 21 2024
REFERENCES
Olivier Bodini and Eric Rivals. Tiling an Interval of the Discrete Line. In M. Lewenstein and G. Valiente, editors, Proc. of the 17th Annual Symposium on Combinatorial Pattern Matching (CPM), volume 4009 of Lecture Notes in Computer Science, pages 117-128. Springer Verlag, 2006.
Juhani Karhumaki, Yury Lifshits and Wojciech Rytter, Tiling Periodicity, in Combinatorial Pattern Matching, Lecture Notes in Computer Science, Volume 4580/2007, Springer-Verlag.
LINKS
Reinhard Zumkeller, Table = of n, a(n) for n = 1..10000
Olivier Bodini and Eric Rivals, Tiling an Interval of the Discrete Line
Thomas Fink, Recursively divisible numbers, arXiv:1912.07979 [math.NT], 2019. See Table 1 p. 8.
T. M. A. Fink, Properties of the recursive divisor function and the number of ordered factorizations, arXiv:2307.09140 [math.NT], 2023.
Michael Greene and Robin Michaels, One Dimensional Tilings, Eureka (Cambridge) 54 (1996), 4-13.
G. Hajos, Sur le problème de factorisation des groupes cycliques, Acta Math. Acad. Sci. Hung., 1:189-195, 1950.
J. Karhumaki and Y. Lifshits, Tiling periodicity.
M. Krasner and B. Ranulac, Sur une propriété des polynomes de la division du cercle, Comptes Rendus Académie des Sciences Paris, 240:397-399, 1937.
Eric H. Rivals, Tiling
FORMULA
a(n) = 2*A074206(n), n>1. - Vladeta Jovovic, Jul 03 2005
a(p^k) = 2^k for primes p. - Reinhard Zumkeller, Sep 03 2006
a(n) = Sum_{d|n} A002033(d - 1). - Gus Wiseman, Jul 13 2018
Dirichlet g.f.: zeta(s) / (2 - zeta(s)). - Álvar Ibeas, Dec 30 2018
G.f. A(x) satisfies: A(x) = x/(1 - x) + Sum_{k>=2} A(x^k). - Ilya Gutkovskiy, May 18 2019
EXAMPLE
a(12) = 1 + a(6) + a(4) + a(3) + a(2) + a(1)
= 1+(1+a(3)+a(2)+a(1))+(1+a(2)+a(1))+(1+a(1))+(1+a(1))+(1)
= 1+(1+(1+a(1))+(1+a(1))+1)+(1+(1+a(1))+1)+(1+1)+(1+1)+(1)
= 1+(1+(1+1)+(1+1)+1)+(1+(1+1)+1)+(1+1)+(1+1)+(1)
= 1 + 6 + 4 + 2 + 2 + 1 = 16.
MAPLE
a:= proc(n) option remember;
1+add(a(d), d=numtheory[divisors](n) minus {n})
end:
seq(a(n), n=1..100); # Alois P. Heinz, Apr 17 2021
MATHEMATICA
a[1]=1; a[n_] := a[n] = 1+Sum[If[Mod[n, d]==0, a[d], 0], {d, 1, n-1}]; Array[a, 100] (* Jean-François Alcover, Apr 28 2011 *)
PROG
(Haskell)
a067824 n = 1 + sum (map a067824 [d | d <- [1..n-1], mod n d == 0])
-- Reinhard Zumkeller, Oct 13 2011
(PARI) A=vector(100); A[1]=1; for(n=2, #A, A[n]=1+sumdiv(n, d, A[d])); A \\ Charles R Greathouse IV, Nov 20 2012
CROSSREFS
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Feb 08 2002
EXTENSIONS
Entry revised by N. J. A. Sloane, Aug 27 2006
STATUS
approved