22185

Appears in sequences

• Numbers whose base-4 representation contains exactly four 1's and four 2's.at n=4A045109
• 9 times octagonal numbers: a(n) = 9*n*(3*n-2).at n=29A064201
• Numbers n such that the Diophantine equation x^4+y^5=n^4 has solutions.at n=33A070756
• a(n) is the least k such that (k*prime(n)#)^2 + 1, ((k+1)*prime(n)#)^2 + 1 and ((k+2)*prime(n)#)^2 + 1 are 3 primes, where prime(n)# is the n-th primorial.at n=39A098765
• a(0)=1, a(1)=1, a(n) = 9*a(n/2) for even n >= 2, and a(n) = 8*a((n-1)/2) + a((n+1)/2) for odd n >= 3.at n=30A116526
• Numbers k such that 2*k+1, 4*k+1, 8*k+1 and 16*k+1 are primes.at n=21A124412
• Numbers k such that 2*k+1, 4*k+1, 8*k+1, 16*k+1 and 32*k+1 are primes.at n=5A124413
• a(n)*a(n-11) = a(n-1)*a(n-10)+a(n-5)+a(n-6) with initial terms a(1)=...=a(11)=1.at n=31A133848
• 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, 0, 0), (0, 0, 1), (1, -1, 1), (1, 0, 0), (1, 1, -1)}.at n=8A150157
• Numbers m such that m*reversal(m) contains every decimal digit exactly once.at n=8A178929
• Number of partitions of n with difference -3 between the number of odd parts and the number of even parts, both counted without multiplicity.at n=45A242689
• 29-gonal pyramidal numbers: a(n) = n*(n+1)*(9*n-8)/2.at n=17A256649
• Let a(0)=1. Then a(n) = sums of consecutive strings of positive integers of length 3*n, starting with the integer 2.at n=17A289721
• Number of compositions (ordered partitions) of n into distinct parts >= 4.at n=45A339102
• Odd numbers k such that sigma(k^2) > 2*k^2 and A003415(sigma(k^2)) < k^2.at n=45A347891