29161

Appears in sequences

• a(n) = n^2*(2*n^2 - 1); also Sum_{k=0..n-1} (2k+1)^3.at n=11A002593
• Pseudoprimes to base 3.at n=39A005935
• Odd triangular numbers with prime indices.at n=24A034954
• Numbers n such that n | 11^n + 10^n + 1.at n=15A057294
• a(n) = 49*(n*(n+1)/2) + 6.at n=34A061792
• Triangular numbers which are the sum of two squares.at n=33A073613
• Least number x such that gcd(phi(x), sigma(x)) = n.at n=21A073815
• Smallest number m such that GCD(a+b,a-b) = n, where a = sigma(m) and b = phi(m).at n=21A077102
• Sort the digits of these triangular numbers into descending order and drop zeros to get primes.at n=32A082923
• Triangular numbers which are one more than a product of distinct triangular numbers.at n=19A083517
• Number of those nonnegative integer solutions of the congruence x_1+2x_2+...+(n-1)x_{n-1} = 0 (mod n) which are indecomposable, that is, are not nonnegative linear combinations of other nonnegative integer solutions.at n=22A096337
• Transform of n^3 by the Riordan array (1/(1-x^2), x).at n=21A105636
• Concatenation of triangular number k and its 10's complement is prime.at n=16A108970
• Triangular numbers for which the number of divisors is also a triangular number.at n=18A116541
• Hexagonal numbers whose number of divisors is also a hexagonal number.at n=7A116565
• Triangular numbers with at most two distinct prime factors.at n=37A119663
• Hexagonal numbers (A000384) which are sum of 2 other hexagonal numbers > 0.at n=23A133215
• G.f. satisfies A(x) = Product_{k>0} (1+x^k*A(x)).at n=12A145267
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, 0), (1, 0, -1), (1, 0, 1)}.at n=10A148689
• Terms of A122780 which are not Carmichael numbers A002997.at n=38A153514