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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A064019 Numbers n such that sopf(n) = sopf(n^2-1), where sopf(n) = A008472(n). 2
1, 5, 51, 99, 155, 209, 2369, 2569, 2882, 5745, 15143, 21691, 34573, 36566, 40516, 41237, 65304, 82718, 101638, 112305, 185701, 238302, 247221, 254865, 291399, 439104, 445794, 483107, 532645, 538531, 570020, 690238, 698561, 772485, 805013 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

LINKS

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

PROG

(PARI) sopf(n, s, fac, i)=fac=factor(n); for(i=1, matsize(fac)[1], s=s+fac[i, 1]); return(s); for(n=1, 10^6, if(sopf(n)==sopf(n^2-1), print(n)))

(PARI) sopf(n)= { local(f, s=0); f=factor(n); for(i=1, matsize(f)[1], s+=f[i, 1]); return(s) } { n=0; for (m=1, 10^9, if (sopf(m)==sopf(m^2 - 1), write("b064019.txt", n++, " ", m); if (n==100, break)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Sep 06 2009]

CROSSREFS

Sequence in context: A160779 A077681 A117710 * A134938 A068540 A041043

Adjacent sequences:  A064016 A064017 A064018 * A064020 A064021 A064022

KEYWORD

nonn

AUTHOR

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

EXTENSIONS

a(21)-a(35) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Jun 15 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 18:53 EST 2012. Contains 205844 sequences.