24960
domain: N
Appears in sequences
- Number of ways of writing n as a sum of 6 squares.at n=35A000141
- a(n+2) = 2*a(n+1) + 2*a(n); a(0) = 1, a(1) = 3.at n=10A028859
- Decimal part of a(n)^(1/2) starts with a 'nine digits' anagram.at n=10A034277
- There exists some k>0 such that n is the product of (k + digits of n).at n=19A055482
- a(n) = phi(n^3 + n^2 + n + 1).at n=30A066792
- (Sum of digits of n)^5 - (sum of digits^5 of n).at n=26A069965
- Numbers k not in A065036 but such that tau(k) = omega(k)^3.at n=23A074853
- Coefficients A_n for the s=3 tennis ball problem.at n=5A075045
- Smallest a(n)>a(n-1) such that a(n)^2+a(n-1)^2 is a perfect square, a(1)=6.at n=37A076672
- Smallest a(n)>a(n-1) such that a(n)^2+a(n-1)^2 is a perfect square, a(1)=7.at n=33A076673
- Smallest a(n)>a(n-1) such that a(n)^2+a(n-1)^2 is a perfect square, a(1)=10.at n=33A076675
- Smallest a(n)>a(n-1) such that a(n)^2+a(n-1)^2 is a perfect square, a(1)=11.at n=31A076676
- Smallest k such that d(phi(k)) - phi(d(k)) = -n, where d(k) = A000005(k) and phi(k) = A000010(k).at n=7A078151
- Ordered m for which m = k^3*a*b*(a^4 - b^4) determine (unique) solution triples(k,a,b), where k=1,2,3,... and (a,b) are coprime pairs, not both odd (i.e., of opposite parity).at n=20A081779
- Numbers n such that n=(d_1+4)*(d_2+4)*...*(d_k+4) where d_1 d_2 ... d_k is the decimal expansion of n.at n=4A098114
- a(n) = 2^(n-1)*ChebyshevU(n-1, 2).at n=6A099156
- a(n) = 2*a(n-1) + 4*a(n-2) - 4*a(n-3) - 4*a(n-4).at n=11A099176
- a(n)=2a(n-1)+4a(n-2)-4a(n-3)-4a(n-4).at n=11A099177
- Positive integers i for which A112049(i) == 8.at n=30A112068
- Numbers n>9 such that n=Abs[(c+d_1)*(c+d_2)*...*(c+d_k)] where d_1 d_2 ... d_k is the decimal expansion of n and c is an integer constant.at n=35A113756