|
Search: id:A063071
|
|
|
| A063071 |
|
Sigma(n)*Omega(n) = sigma(n+1)*Omega(n+1), where Omega(n) is the number of distinct prime divisors of n (A001221). |
|
+0
1
|
|
| 14, 206, 1334, 1634, 2685, 14841, 18873, 19358, 26872, 33998, 36566, 42818, 56564, 84134, 116937, 122073, 161001, 162602, 166934, 174717, 190773, 193893, 239499, 245768, 260096, 289454, 326884, 383594, 409695, 422073, 430137, 438993, 440013
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=1,...,100
|
|
PROGRAM
|
(PARI) for(n=1, 10^6, if(sigma(n)*omega(n)==sigma(n+1)*omega(n+1), print(n)))
(PARI) { n=0; s=1; for (m=1, 10^9, if(s!=(r=sigma(m)*omega(m)), s=r, write("b063071.txt", n++, " ", m - 1); if (n==100, break)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 16 2009]
|
|
CROSSREFS
|
Cf. A001221, A002961, A000203.
Sequence in context: A113349 A109764 A002961 this_sequence A160682 A097261 A158555
Adjacent sequences: A063068 A063069 A063070 this_sequence A063072 A063073 A063074
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Jason Earls (zevi_35711(AT)yahoo.com), Aug 04 2001
|
|
|
Search completed in 0.002 seconds
|
