|
Search: id:A065925
|
|
|
| A065925 |
|
Smallest k such that sopf(n+k) = sopf(k), where sopf = A008472. |
|
+0
4
|
|
| 5, 2, 7, 4, 114, 2, 5, 8, 13, 10, 25, 4, 5, 2, 19, 16, 85, 6, 5, 5, 209, 22, 25, 3, 493, 26, 31, 4, 20, 2, 5, 32, 7, 34, 516, 12, 33, 38, 10, 10, 99, 6, 5, 44, 57, 46, 25, 6, 5, 50, 49, 52, 52, 18, 855, 8, 61, 58, 295, 4, 261, 2, 91, 64, 602, 6, 5, 68, 21, 10, 25, 9, 7, 74, 13, 76
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
J. Earls, Mathematical Bliss, Pleroma Publications, 2009, pages 99-100. ASIN: B002ACVZ6O [From Jason Earls (zevi_35711(AT)yahoo.com), Nov 26 2009]
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=1,...,1000
C. Rivera, www.primepuzzles.net, Conjecture 25
|
|
EXAMPLE
|
a(6) = 2 because A008472(2) = A008472(6+2) = 2, but A008472(1) = 0 doesn't equal A008472(6+1) = 7.
|
|
PROGRAM
|
(PARI):sopf(n) = local(fac, i); fac=factor(n); sum(i=1, matsize(fac)[1], fac[i, 1]) A065925(m)={local(k, n); for(k=1, m, n=1; while(sopf(n)!=sopf(n+k), n++); print1(n, ", "))} - Klaus Brockhaus
(PARI) sopf(n)= { local(f, s=0); f=factor(n); for(i=1, matsize(f)[1], s+=f[i, 1]); return(s) } { for (n=1, 1000, k=2; while (sopf(n + k) != sopf(k), k++); write("b065925.txt", n, " ", k) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Nov 04 2009]
|
|
CROSSREFS
|
Cf. A008472, A065926, A065927.
Sequence in context: A064677 A088520 A084340 this_sequence A080350 A074454 A155790
Adjacent sequences: A065922 A065923 A065924 this_sequence A065926 A065927 A065928
|
|
KEYWORD
|
nonn,new
|
|
AUTHOR
|
Jason Earls (zevi_35711(AT)yahoo.com), Nov 28 2001
|
|
|
Search completed in 0.002 seconds
|
