35456

Appears in sequences

• Ruth-Aaron numbers (1): sum of prime divisors of n = sum of prime divisors of n+1.at n=28A006145
• Numbers whose base-4 representation contains exactly four 0's and four 2's.at n=19A045061
• Triangle T(n, k) is coefficient of z^n*w^k in 1/(1 - 2*z - 2*w - 2*z*w) read by rows in order 00, 10, 01, 20, 11, 02, ...at n=47A059473
• Triangle T(n, k) is coefficient of z^n*w^k in 1/(1 - 2*z - 2*w - 2*z*w) read by rows in order 00, 10, 01, 20, 11, 02, ...at n=52A059473
• Numbers k such that sopf(k) = sopfr(k+1), where sopf(k) = A008472(k) and sopfr(k) = A001414(k).at n=34A064678
• a(n) = Sum_{k=0..floor(n/4)} C(n-k,3*k) * 2^(n-3*k).at n=11A099785
• Ceiling(n/3)-perfect numbers.at n=14A177084
• Numbers n whose deficiency is 22: sigma(n) - 2*n = -22.at n=8A223606
• a(n) = Glaisher's function beta(2n+1).at n=28A322032
• Irregular triangular array, read by rows: row n shows the coefficients of the polynomial p(n,x) defined in Comments.at n=13A329432
• Numbers k such that the sum of the divisors of k (except for 1 and k) plus the sum of the digits of k is equal to k.at n=11A331037
• The number of binary sequences of length n for which all patterns {0,1},{0,0},{1,0},{1,1} appear for the first time. In particular, three of the patterns will have appeared at least once before the (n-1)st digit in the sequence and the remaining pattern appears for the first and only time at positions {n-1,n} in the sequence.at n=18A364685