36968

Appears in sequences

• Number of dyslexic planted planar trees with n+1 nodes where any 2 subtrees extending from the same node are different sizes.at n=15A032047
• McKay-Thompson series of class 22A for Monster.at n=29A058567
• a[n] =a[n-1] + 2*n*Prime[n]-n^2.at n=25A093809
• Triangle P, read by rows, that satisfies [P^8](n,k) = P(n+1,k+1) for n>=k>=0, also [P^(8*m)](n,k) = [P^m](n+1,k+1) for all m, where [P^m](n,k) denotes the element at row n, column k, of the matrix power m of P, with P(0,k)=1 and P(k,k)=1 for all k>=0.at n=11A111835
• Number of partitions of 7*8^n into powers of 8, also equals column 1 of triangle A111835, which shifts columns left and up under matrix 8th power.at n=3A111836
• Base-6 analog of A208059.at n=29A212995
• Numbers k with nonzero digits such that k +/- the product of digits of k are both palindromes.at n=14A244547
• Triangle read by rows: T(n,k) = t(n-k, k); t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1), where f(x) = 3*x + 4.at n=16A257622
• Triangle read by rows: T(n,k) = t(n-k, k); t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1), where f(x) = 3*x + 4.at n=19A257622
• Number of partitions of n such that the (sum of distinct even parts) > n/2.at n=49A284618
• Number of partitions of n such that the (sum of distinct even parts) >= n/2.at n=49A284619
• Number of nX4 0..1 arrays with every element equal to 0, 1, 2, 3, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=5A299848
• Number of nX6 0..1 arrays with every element equal to 0, 1, 2, 3, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=3A299850
• T(n,k) = Number of n X k 0..1 arrays with every element equal to 0, 1, 2, 3, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=39A299852
• T(n,k) = Number of n X k 0..1 arrays with every element equal to 0, 1, 2, 3, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=41A299852