21874

Appears in sequences

• a(n) = M(n) + m(n) for n >= 2, where M(n) = max{ a(i) + a(n-i): i = 1..n-1 }, m(n) = min{ a(i) + a(n-i): i = 1..n-1 }.at n=32A022905
• Numbers k such that k^4 == 1 (mod 5^5).at n=27A056102
• a(n) = 625*n - 1.at n=34A158374
• Table by rows, the number E(n;2) of binary-alphabet topological epsilon-machines as a function of the number of states n and edges k.at n=15A181621
• a(n) = 7*5^n-1.at n=5A198765
• Number of (n+2) X 3 binary arrays avoiding patterns 001 and 110 in rows, columns and nw-to-se diagonals.at n=27A202440
• Number of palindromic Carlitz compositions of n.at n=38A239327
• Expansion of Product_{k>=1} 1/(1 - (4*k-1)*x^(4*k-1)).at n=28A265828
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 403", based on the 5-celled von Neumann neighborhood.at n=32A271809
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 662", based on the 5-celled von Neumann neighborhood.at n=41A273390
• Sum of the third largest parts of the partitions of n into 10 squarefree parts.at n=53A326635
• a(n) = Sum_{(n - k) does not divide n, 0 <= k < n} k^2.at n=45A367327