login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A064111 Numbers k such that sopf(k) + 1 = sopf(k+1), where sopf(k) = A008472(k). 1
2, 8, 120, 168, 175, 247, 860, 1044, 1444, 1659, 1849, 3626, 3834, 4233, 4300, 4345, 4814, 6867, 8240, 14905, 23287, 24476, 28919, 29087, 29464, 30457, 30650, 33725, 34945, 35585, 37214, 49468, 52206, 54900, 58113, 62049, 63440, 65631, 68264 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Also k such that z(k) = z(k+1) where z(k) = k - sopf(k).

Prime factors counted without multiplicity. - Harvey P. Dale, Dec 26 2015

LINKS

Harry J. Smith, Table of n, a(n) for n = 1..1000

EXAMPLE

sopf(8) + 1 = 3, sopf(8 + 1) = 3.

MATHEMATICA

Flatten[Position[Partition[Table[Total[Transpose[FactorInteger[n]] [[1]]], {n, 2, 70000}], 2, 1], _?(#[[1]]+1==#[[2]]&), {1}, Heads->False]]+1 (* Harvey P. Dale, Dec 26 2015 *)

PROG

(PARI) sopf(n, s, fac, i)=fac=factor(n); for(i=1, matsize(fac)[1], s=s+fac[i, 1]); return(s);

j=[]; for(n=1, 100000, if(sopf(n)+1==sopf(n+1), j=concat(j, n))); j

(PARI) z(n)= { local(f, s=0); f=factor(n); for(i=1, matsize(f)[1], s+=f[i, 1]); return(n - s) }

{ n=0; zm=z(1); for (m=1, 10^9, zp=z(m + 1); if (zm==zp, write("b064111.txt", n++, " ", m); if (n==1000, break)); zm=zp ) } \\ Harry J. Smith, Sep 07 2009

CROSSREFS

Cf. A006145.

Sequence in context: A297631 A099292 A284967 * A112094 A009658 A147794

Adjacent sequences:  A064108 A064109 A064110 * A064112 A064113 A064114

KEYWORD

nonn

AUTHOR

Jason Earls, Sep 08 2001

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 25 16:50 EDT 2019. Contains 326324 sequences. (Running on oeis4.)