104856

Appears in sequences

• Sums of lists produced by a variant of the iteration that produces the Catalan numbers: start with 0 and at each iteration replace each integer k with the list 0,1,...,k-1,k,k+1,k,k-1,...,1,0 and let a(n) be the sum of the resulting (flattened) list after n iterations.at n=8A065096
• Numbers m such that phi(m) = tau(m)^3.at n=34A068559
• a(n) = 4 * floor(24*2^n/15) = 4*A077854(n).at n=14A102652
• Triangular array formed by the little Schröder numbers s(n,k).at n=37A110440
• a(n) = (n^5 - n)/10, which is always an integer.at n=15A164938
• Binary XOR of 2^k - (-1)^k as k varies from 1 to n.at n=17A199402
• Binary XOR of (2^k - (-1)^k)/3 as k varies from 1 to n.at n=17A199403
• Chromatic invariant of the n-path complement graph.at n=10A302978
• Records in A175046.at n=23A319422