A372692 -id:A372692 - cp's OEIS frontend

A372693 Numbers k such that A372692(k) = A372692(k+1) > 1.

7380, 18755, 24804, 25631, 26299, 27467, 32799, 44891, 49196, 49725, 50940, 53603, 59652, 64386, 71027, 79739, 85788, 89300, 94275, 103212, 105056, 105875, 124992, 129348, 132011, 138060, 141899, 147100, 149435, 155484, 158147, 164196, 170324, 175571, 181620, 184283

Offset: 1

Amiram Eldar, May 10 2024

nonn

The numbers k such that A372692(k) = A372692(k+1) = 1 are in A372690.

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A036537, A372690, A372692.
Subsequence of A068781.
A372694 is a subsequence.
Similar sequences: Cf. A002961, A064125, A293183, A306985, A343819, A348346.

f[p_, e_] := p^(2^(-1 + Position[Reverse@ IntegerDigits[e, 2], ?(# == 0 &)])); s[1] = 1; s[n] := s[n] = Times @@ (Flatten@ (f @@@ FactorInteger[n]) + 1);
Select[Range[10^5], (s1 = s[#]) > 1 && s1 == s[# + 1] &]

s(n) = {my(f = factor(n), k); prod(i = 1, #f~, k = apply(x -> 1 - x, binary(f[i, 2])); prod(j = 1, #k, if(k[j], f[i, 1]^(2^(#k-j)) + 1, 1)));}
lista(kmax) = {my(s1 = s(1), s2); for(k = 2, kmax, s2 = s(k); if(s1 > 1 && s1 == s2, print1(k - 1, ", ")); s1 = s2);}

A372694 Numbers k such that A372692(k) = A372692(k+1) = A372692(k+2) > 1.

Original entry on oeis.org

17784450, 28873348, 38990474, 44534923, 48780675, 85648274, 95438475, 100982924, 111100050, 157757850, 184508323, 188754075, 225621674, 240956324, 251073450, 308820148, 318937274, 334271924, 365595074, 371139523, 378806848, 391046850, 437704650, 505568474, 511112923

Offset: 1

Amiram Eldar, May 10 2024

nonn

Can 4 consecutive integers have the same value of A372692? There are none below 2*10^10.

Amiram Eldar, Table of n, a(n) for n = 1..1200

Subsequence of A070258 and A372693.

Cf. A334021, A324310, A372692.

f[p_, e_] := p^(2^(-1 + Position[Reverse@ IntegerDigits[e, 2], ?(# == 0 &)])); s[1] = 1; s[n] := s[n] = Times @@ (Flatten@ (f @@@ FactorInteger[n]) + 1);
Select[Range[10^8], (s1 = s[#]) > 1 && s1 == s[# + 1] == s[# + 2] &]

s(n) = {my(f = factor(n), k); prod(i = 1, #f~, k = apply(x -> 1 - x, binary(f[i, 2])); prod(j = 1, #k, if(k[j], f[i, 1]^(2^(#k-j)) + 1, 1)));}
lista(kmax) = {my(s1 = s(1), s2 = s(2), s3); for(k = 3, kmax, s3 = s(k); if(s1 > 1 && s1 == s2 && s2 == s3, print1(k - 2, ", ")); s1 = s2; s2 = s3);}

cp's OEIS Frontend

A372693 Numbers k such that A372692(k) = A372692(k+1) > 1.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI