cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A329538 Odd composite numbers k such that A111076(k)^((k-1)/2) == -1 (mod k).

Original entry on oeis.org

29341, 1152271, 5481451, 14913991, 15247621, 36765901, 133800661, 178482151, 299736181, 579606301, 652969351, 702683101, 739444021, 743404663, 775368901, 3215031751, 4340265931, 5871134179, 8657319259, 9293756581, 12191597551, 13734086221, 14386156093, 19331388805
Offset: 1

Views

Author

Amiram Eldar and Thomas Ordowski, Nov 16 2019

Keywords

Comments

Carmichael numbers k such that A111076(k)^((k-1)/2) == -1 (mod k).
Note that if p is an odd prime, then A111076(p)^((p-1)/2) == -1 (mod p).
Max Alekseyev proved (in a letter to the second author) that all these numbers have an odd number of prime factors, showing that if k is a term, then k is a Carmichael number m such that p-1 does not divide (m-1)/2 for every prime p|m (the numbers m form the supersequence A329799).
There are 6469 terms k of this sequence below 2^64:
4240 with 3 prime factors, least is 29341 = 13*37*61,
1790 with 5 prime factors, least is 4340265931 = 19*43*107*131*379,
437 with 7 prime factors, least is 37038179683765 = 5*13*29*37*317*757*2213,
2 with 9 prime factors, least is 1025735495681200591 = 7*19*31*67*79*163*199*271*5347.

Crossrefs

Subsequence of A262043.

Programs

  • Mathematica
    f[1, lam_] = 1; f[n_, lam_] := If[n < 5, n - 1, Module[{k = 1}, While[GCD[k, n] > 1 || MultiplicativeOrder[k, n] < lam, k++]; k]]; aQ[n_] := CompositeQ[n] && Divisible[n - 1 , (lam = CarmichaelLambda[n])] && PowerMod[f[n, lam], (n - 1)/2, n] == n - 1; Select[Range[1, 6*10^6, 2], aQ] (* after the Charles R Greathouse IV at A111076 *)

A382791 Carmichael numbers with exactly 3 prime factors, p*q*r, such that p-1, q-1 and r-1 have an equal 2-adic valuation.

Original entry on oeis.org

8911, 29341, 314821, 410041, 1024651, 1152271, 5481451, 10267951, 14913991, 15247621, 36765901, 64377991, 67902031, 133800661, 139952671, 178482151, 188516329, 299736181, 362569201, 368113411, 395044651, 532758241, 579606301, 612816751, 620169409, 625482001, 652969351
Offset: 1

Views

Author

Amiram Eldar, Apr 05 2025

Keywords

Comments

Subsequence of A329799 and first differs from it at n = 36: A329799(36) = 1419339691 is not a term of this sequence.

Examples

			8911 = 7 * 19 * 67 is a term since it is a Carmichael number, it has exactly 3 prime factors, and 7 - 1 = 2*3, 19 - 1 = 2*3^2, and 67 - 1 = 2*3*11 all have 2-adic valuation 1.
		

Crossrefs

Subsequence of A002997, A087788 and A329799.
Cf. A007814.

Programs

  • Mathematica
    q[n_] := Module[{f = FactorInteger[n]}, f[[;; , 2]] == {1, 1, 1} && SameQ @@ IntegerExponent[f[[;; , 1]] - 1, 2]];
    Select[Cases[Import["https://oeis.org/A002997/b002997.txt", "Table"], {, }][[;; , 2]], q]
  • PARI
    isok(k) = if(!(k % 2) || isprime(k), 0, my(f = factor(k)); #f~ == 3 && k % lcm(znstar(k)[2]) == 1 && #Set(apply(x -> valuation(x-1, 2), f[,1])) == 1);
Showing 1-2 of 2 results.