26446

Appears in sequences

• a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = a(3) = 2.at n=15A049954
• Maximal value of Sum_{i=1..n} (p(i) - p(i+1))^2, where p(n+1) = p(1), as p ranges over all permutations of {1, 2, ..., n}.at n=42A064842
• a(n) = n*(n^2+3*n-1)/3.at n=42A084990
• Expansion of x^9/((1-x)*(1-x^2)*(1-x^3))^2.at n=35A117485
• G.f. satisfies: A(x) = (1+x+x^2) * A(x^2)^2.at n=39A237651
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 278", based on the 5-celled von Neumann neighborhood.at n=43A271097
• a(n) = A055498(n) - A055500(n).at n=22A362883