The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A323070 Numbers k such that A055023(k) != A323071(k), where A323071(k) = gcd(k, 1+A060681(k)). 2
 55, 105, 155, 203, 253, 355, 405, 455, 497, 595, 655, 689, 705, 737, 755, 791, 955, 979, 1005, 1027, 1055, 1081, 1221, 1255, 1305, 1355, 1379, 1555, 1605, 1655, 1673, 1703, 1711, 1751, 1855, 1905, 1955, 1967, 2065, 2155, 2189, 2205, 2255, 2261, 2329, 2455, 2505, 2555, 2755, 2805, 2849, 2855, 3055 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Equivalently, numbers k for which A055032(k) != A323072(k). Neither primes nor prime powers present? LINKS Table of n, a(n) for n=1..53. PROG (PARI) A055023(n) = (n/denominator((sum(m=1, n - 1, m^(n - 1)) + 1)/n)); \\ From A055023. A060681(n) = (n-if(1==n, n, n/vecmin(factor(n)[, 1]))); A323071(n) = gcd(n, 1+A060681(n)); is_A323070(n) = (A055023(n)!=A323071(n)); CROSSREFS Cf. A055023, A055032, A060681, A323071, A323072. Sequence in context: A146145 A044144 A044525 * A118151 A277273 A275124 Adjacent sequences: A323067 A323068 A323069 * A323071 A323072 A323073 KEYWORD nonn AUTHOR Antti Karttunen, Jan 04 2019 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 12 19:26 EDT 2024. Contains 375113 sequences. (Running on oeis4.)