28575

Appears in sequences

• Numbers k such that k and 3*k are anagrams.at n=15A023087
• a(n) = Sum_{ d|n } sigma(n/d)*d^4.at n=12A027848
• Sums of distinct powers of 13.at n=19A033049
• Number of ways to write n as the arithmetic mean of a set of distinct primes.at n=30A072701
• Numbers n such that 4*10^n + 5*R_n - 2 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=19A102991
• Maximal value of GCD of 2 distinct n-digit numbers using the same digits.at n=3A126687
• Numbers k such that k*(k+1)-1 and k*(k+1)+1 are twin primes and k*(k+3)-1 and k*(k+3)+1 are also twin primes.at n=17A138303
• (n-1)^(p-n+1)+n where p is the smallest prime > n-1.at n=13A171424
• Numbers that can be formed using its own digits in order and only addition and fourth power operators.at n=27A195672
• Least sum of a set of n odious numbers (A000069) such that the sum of two or more is an evil number (A001969).at n=6A230387
• a(n) = (n^4 + 2*n^3 - n^2)/2.at n=15A255499
• Odd numbers n such that the sum of the binary digits of n and n^2 both equal 12.at n=37A261593
• a(n) = Sum_{d|n} d^4*A000593(n/d).at n=12A288420
• a(n) is the least positive multiple of 2*n-1 containing only the digits 0 and 1 in base n.at n=12A337623
• G.f.: 1 / (1 + x + Sum_{k>=2} prime(k-1) * x^k).at n=47A346792