829921

Appears in sequences

• a(n) = (F(n+1)+L(n)+n)^2 where F(n) are the Fibonacci numbers (A000045) and L(n) are the Lucas numbers (A000032).at n=13A014718
• Numbers whose sum of divisors is prime.at n=36A023194
• a(n) = prime^2 and digits of prime appear in a(n).at n=20A030081
• Composite numbers not divisible by 7 which in base 7 contain their largest proper factor as a substring.at n=29A063877
• Numbers k that require four iterations of the sigma function to be >= 2*k.at n=18A107914
• Odd numbers N for which numerator(sigma(N)/N) is a prime.at n=31A193065
• Numbers k such that tau(sigma(tau(k))) = sigma(tau(sigma(k))), where tau is A000005 and sigma is A000203.at n=26A237613
• The smaller of a pair of successive powerful numbers (A001694) without any prime number between them.at n=39A240591
• Squares s such that s + 1234567890 is prime.at n=31A241538
• Number of (n+3)X(2+3) 0..1 arrays with each row and column divisible by 9, read as a binary number with top and left being the most significant bits.at n=9A262334
• Odd numbers with prime sum of divisors.at n=29A278911
• Numbers m such that m! / sigma(m) is not an integer.at n=37A325436
• Numbers k for which A348717(k) is a multiple of A348717(sigma(k)).at n=42A364131