24832

Appears in sequences

• Intrinsic 10-palindromes: n is an intrinsic k-palindrome if it is a k-digit palindrome in some base.at n=37A060947
• Expansion of g.f.: 1/( (1+2*x)*(1-2*x-4*x^2)*(1-2*x^2)^2 ).at n=9A121961
• Number of permutations of {1,2,3,...,n} each with the same up-down signature as its inverse permutation.at n=10A135410
• a(n+1)-+a(n)=prime, a(n+1)*a(n)=Average of twin prime pairs, a(1)=1,a(2)=4.at n=31A154493
• a(n) = 97*n^2.at n=16A174338
• Products of the 8th power of a prime and a distinct prime (p^8*q).at n=24A179668
• Number of (n+1) X (n+1) binary arrays with no 2 X 2 subblock trace equal to any horizontal or vertical neighbor 2 X 2 subblock trace.at n=3A185760
• Number of (n+1) X 5 binary arrays with no 2 X 2 subblock trace equal to any horizontal or vertical neighbor 2 X 2 subblock trace.at n=3A185764
• T(n,k)=Number of (n+1)X(k+1) binary arrays with no 2X2 subblock trace equal to any horizontal or vertical neighbor 2X2 subblock trace.at n=24A185769
• Numbers of the form (24*x + 1)*2^(y+6) with positive integers x and y.at n=12A231203
• Values of n such that there are exactly 7 solutions to x^2 - y^2 = n with x > y >= 0.at n=36A257414
• G.f.: Sum_{k>=1} x^(2*k)/(1-x^(2*k)) * Product_{k>=1} (1+x^k)/(1-x^k).at n=22A305104
• a(n) is the smallest number which can be represented as the sum of n distinct nonzero n-gonal pyramidal numbers in exactly n ways, or -1 if no such number exists.at n=8A350397
• a(n) = n^4 * Sum_{p|n, p prime} 1/p^4.at n=23A351244
• Numbers that can be written as a^2 + 3*b^2 for some a, b in A155716 and also as c^2 + 6*d^2 for some c, d in A092572.at n=18A380295
• a(n) = 2^(n-2)*(3*binomial(n,3) + 6*binomial(n,2) + 6*n + 4).at n=8A385589