Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A064111
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A064111 Numbers n such that sopf(n)+1 = sopf(n+1), where sopf(n)=A008472(n). +0
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; listen)
OFFSET

1,1

COMMENT

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

LINKS

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

EXAMPLE

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

PROGRAM

(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 ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Sep 07 2009]

CROSSREFS

Cf. A006145.

Sequence in context: A012343 A012347 A099292 this_sequence A112094 A009658 A147794

Adjacent sequences: A064108 A064109 A064110 this_sequence A064112 A064113 A064114

KEYWORD

nonn

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), Sep 08 2001

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research