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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A362400 Numbers k such that A162296(k) = A162296(k+1) > 0. 1
135, 819, 1863, 9207, 10340, 41124, 75051, 95336, 278972, 305091, 465596, 544924, 570411, 711027, 903804, 977876, 1114695, 1327095, 1444779, 1520684, 1760571, 1987371, 2083491, 2303091, 2581928, 2842324, 2869011, 3062631, 3243140, 4043624, 4335848, 4469984, 4598091 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
A162296(k) = A162296(k+1) = 0 if and only if k and k+1 are both squarefree (A005117), i.e., k is in A007674.
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..527 (terms below 10^10)
EXAMPLE
135 is a term since A162296(135) = A162296(136) = 216.
MATHEMATICA
s[n_] := Module[{f = FactorInteger[n], p, e}, p = f[[;; , 1]]; e = f[[;; , 2]]; Times @@ ((p^(e + 1) - 1)/(p - 1)) - Times @@ (p + 1)]; Select[Range[2, 5*10^6], (sn = s[#]) > 0 && sn == s[# + 1] &]
PROG
(PARI) s(n) = {my(f = factor(n), p, e); prod(i = 1, #f~, p = f[i, 1]; e = f[i, 2]; ((p^(e + 1) - 1)/(p - 1))) - prod(i = 1, #f~, f[i, 1] + 1); }
lista(kmax) = {my(s1 = s(1), s2); for(k=2, kmax, s2 = s(k); if(s1 > 0 && s2 == s1, print1(k-1, ", ")); s1 = s2); }
CROSSREFS
Subsequence of A013929 and A068781.
Sequence in context: A225360 A328651 A159201 * A211680 A212610 A336554
KEYWORD
nonn
AUTHOR
Amiram Eldar, Apr 18 2023
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 23 05:07 EDT 2024. Contains 375375 sequences. (Running on oeis4.)