29000

Appears in sequences

• Numbers k such that k^2 has digits in nonincreasing order.at n=38A028821
• Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 85.at n=35A031583
• a(1) = 2, a(n) = a(n-1) + 3*(a(n-1)-floor(a(n-1)^(1/3))^3).at n=26A096295
• a(n) is the smallest number representable in exactly n ways as a sum of 2 powerful(1) numbers.at n=13A115354
• Integers that can be generated with a C/C++ expression that is shorter than their decimal representation.at n=28A168650
• Number of (n+1) X 2 0..3 arrays with the number of clockwise edge increases in every 2 X 2 subblock unequal to the number of counterclockwise edge increases.at n=3A206014
• Number of (n+1) X 5 0..3 arrays with the number of clockwise edge increases in every 2 X 2 subblock unequal to the number of counterclockwise edge increases.at n=0A206017
• T(n,k) = number of (n+1) X (k+1) 0..3 arrays with the number of clockwise edge increases in every 2 X 2 subblock unequal to the number of counterclockwise edge increases.at n=6A206021
• T(n,k) = number of (n+1) X (k+1) 0..3 arrays with the number of clockwise edge increases in every 2 X 2 subblock unequal to the number of counterclockwise edge increases.at n=9A206021
• Number of length 3+1 0..n arrays with the sum of the maximum of each adjacent pair multiplied by some arrangement of +-1 equal to zero.at n=38A250647
• a(n) = Sum_{k=1..n, gcd(n,k) = 1} binomial(n,k)^2.at n=9A337003
• G.f. satisfies A(x) = exp( Sum_{k>=1} (A(x^k) + A(w*x^k) + A(w^2*x^k))/3 * x^k/k ), where w = exp(2*Pi*i/3).at n=32A363404
• Expansion of Sum_{k>0} x^(4*k)/(1-x^k)^5.at n=29A363608