login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A263810
Numbers k such that k = tau(k) * phi(k-2) + 1.
1
3, 4, 5, 17, 257, 65537, 83623937
OFFSET
1,1
COMMENTS
Numbers k such that k = A000005(k) * A000010(k-2) + 1.
Sequence deviates from A249541; numbers 4294967297 and 6992962672132097 are not terms of this sequence.
The first 5 known Fermat primes from A019434 are in this sequence.
Conjecture: primes from this sequence are in A254576.
a(8) > 10^13. If k = tau(k) * phi(k-2) + 1 then phi(k-2) must divide k-1, thus k-2 must be a term of A203966, which has already been searched up to 10^13. - Giovanni Resta, Feb 21 2020
a(8) > 10^17. - Max Alekseyev, Sep 29 2023
EXAMPLE
17 is in this sequence because 17 = tau(17)*phi(15) + 1 = 2*8 + 1.
MATHEMATICA
Select[Range@ 100000, # == DivisorSigma[0, #] EulerPhi[# - 2] + 1 &] (* Michael De Vlieger, Oct 27 2015 *)
PROG
(Magma) [n: n in [3..1000000] | n eq NumberOfDivisors(n) * EulerPhi(n-2) + 1]
(PARI) for(n=3, 1e8, if(numdiv(n)*eulerphi(n-2) == n-1, print1(n ", "))) \\ Altug Alkan, Oct 28 2015
(PARI) lista(na, nb) = {my(f1 = factor(na-2), f2 = factor(na-1), f3); for(n=na, nb, f3 = factor(n); if (numdiv(f3)*eulerphi(f1) == n-1, print1(n ", ")); f1 = f2; f2 = f3; ); }; \\ Michel Marcus, Feb 21 2020
CROSSREFS
Cf. A263811 (numbers k such that k = tau(k) * phi(k-1) + 1).
Sequence in context: A173061 A174326 A224890 * A249541 A059184 A161961
KEYWORD
nonn,more
AUTHOR
Jaroslav Krizek, Oct 27 2015
STATUS
approved