102795

Appears in sequences

• a(n) is least k such that k and 5k are anagrams in base n (written in base 10).at n=28A023097
• a(n) is least k such that k and 8k are anagrams in base n (written in base 10).at n=25A023100
• a(n) = floor(((1+sqrt(3))/2)^n).at n=36A125895
• Odd unitary abundant numbers.at n=34A129485
• Numbers n such that n+/-2 and n^2+/-2 are all primes.at n=34A189051
• Erroneous version of A295925.at n=4A210769
• a(n) = Fibonacci(n-1) * Fibonacci(n+1) * Fibonacci(n+2).at n=8A220360
• Primitive, odd, squarefree abundant numbers.at n=34A249263
• Number of pairs of orientable necklaces with n beads and up to 6 colors; i.e., turning the necklace over does not leave it unchanged. The turned-over necklace is not included in the count.at n=8A278642
• Number of bilaterally asymmetric 8-hoops with n symbols.at n=4A295925
• Numbers k such that k^3 +- 2 and k +- 2 are prime.at n=17A329727
• Odd non-coreful abundant numbers: the odd terms of A308127.at n=35A339938
• Smallest m such that m^k-2 and m^k+2 are prime for k=1..n.at n=2A357280
• Odd numbers k such that A360522(k) > 2*k.at n=34A360526
• Odd modified exponential abundant numbers: odd numbers k such that A241405(k) > 2*k.at n=34A379031