32784

Appears in sequences

• a(n) = 2^n + n + 1.at n=15A005126
• Number of 2's in n-th term of A006711.at n=40A022478
• Numbers having four 0's in base 8.at n=15A043424
• Smallest initial values leading to fixed points listed in A077092.at n=5A077093
• Number of binary rooted trees with n nodes and internal path length n.at n=48A108643
• Triangle read by rows: coefficient of x^n in the Taylor expansion of x/(1 - m*x - x^4) in row n, column m=1..n+2.at n=35A117742
• a(n) = 8*n^3 + n.at n=16A118465
• Number of permutations of floor(i*9/7), i=0..n-1, with all sums of 5 adjacent terms unique.at n=7A152367
• Semi-sums (means) of a Fermat prime and a Mersenne prime.at n=22A174057
• a(n) = 16*(2^n + 1).at n=11A175162
• Half the number of n X 2 0..2 arrays with no element equal to the sum mod 3 of its horizontal and vertical neighbors.at n=7A183495
• Half the number of nX8 0..2 arrays with no element equal to the sum mod 3 of its horizontal and vertical neighbors.at n=1A183500
• T(n,k)=Half the number of nXk 0..2 arrays with no element equal to the sum mod 3 of its horizontal and vertical neighbors.at n=37A183501
• T(n,k)=Half the number of nXk 0..2 arrays with no element equal to the sum mod 3 of its horizontal and vertical neighbors.at n=43A183501
• a(n) = 2^x+2^y where p(n) is the n-th prime of the form 4*k+1 and x, y is the unique integer solution to p(n) = x^2+y^2.at n=23A226640
• Numbers of the form 4^j + 8^k, for j and k >= 0.at n=39A226822
• Numbers of the form m = 2^i + 2^j, where i > j >= 0, such that m - 1 is prime.at n=33A239708
• Numbers n such that a digit of n to the power k plus the sum of the other digits of n equals n, where k is a positive integer.at n=22A257860
• Positions of 0 in A288132; complement of A288134.at n=16A288133
• BII-numbers of set partitions with at least two blocks.at n=45A330296