3906250

Appears in sequences

• Numbers that are the sum of 2 positive 9th powers.at n=14A003391
• Numbers that are the sum of at most 2 positive 9th powers.at n=20A004886
• Numbers k such that k | 3^k + 1.at n=24A015949
• Numbers k such that k | 7^k + 1.at n=30A015954
• Expansion of (1-3*x)/(1-5*x).at n=10A020699
• Pisot sequences E(2,10), L(2,10), P(2,10), T(2,10).at n=9A020729
• a(n) = 5*a(n-2), starting 1,2.at n=19A026383
• a(n) = 5*a(n-2), starting 1,2,4.at n=19A026395
• Numbers k such that k | 10^k + 9^k + 8^k + 7^k + 6^k + 5^k + 4^k + 3^k.at n=40A057283
• Numbers k such that k | 12^k + 11^k + 10^k + 9^k + 8^k + 7^k + 6^k + 5^k.at n=33A057491
• Numbers whose sum of exponents is equal to the product of prime factors.at n=21A071174
• Numbers n such that n-th Pisano number = 6*n.at n=9A095687
• a(3*n) = 3*a(3*n-1)-3*a(3*n-2)+2*a(3*n-3), a(3*n+1) = 3*a(3*n)-3*a(3*n-1)+2*a(3*n-2), a(3*n+2) = 3*a(3*n+1)-3*a(3*n) with a(0)=1, a(1)=2, a(2)=3.at n=28A133335
• a(4*n)=5^n, a(4*n+1)=2*5^n, a(4*n+2)=3*5^n, a(4*n+3)=4*5^n.at n=37A140730
• Denominator of Euler(n, 1/5).at n=9A156183
• a(n) = 5*a(n-2) for n > 2; a(1) = 2, a(2) = 5.at n=18A162963
• Numbers k such that the sum of digits of k equals the concatenation of the distinct prime divisors of k.at n=7A212667
• Numbers which have identical primes in n and d(n) but are not refactorable.at n=12A235525
• Numbers k such that the k-th cyclotomic polynomial has a root mod 5.at n=28A245478
• Number of set partitions of [n] such that i-j is a multiple of ten for all i,j belonging to the same block.at n=29A275077