|
Search: id:A063479
|
|
|
| A063479 |
|
Omega(n+1)=2*omega(n), where omega is the number of distinct prime divisors. |
|
+0
1
|
|
| 5, 9, 11, 13, 17, 19, 23, 25, 27, 32, 37, 43, 47, 49, 53, 61, 64, 67, 71, 73, 79, 81, 97, 103, 107, 121, 128, 151, 157, 163, 191, 193, 199, 209, 211, 223, 241, 243, 271, 277, 283, 313, 329, 331, 337, 343, 361, 367, 383, 397, 421, 431, 457, 463, 487, 499, 512
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=1,...,1000
|
|
EXAMPLE
|
omega(209)=2, omega(209+1)=2*2, so 209 is a member of the sequence.
|
|
PROGRAM
|
(PARI) j=[]; for(n=1, 700, if(omega(n+1)==2*omega(n), j=concat(j, n))); j
(PARI) { n=0; for (m=1, 10^9, if (omega(m + 1) == 2*omega(m), write("b063479.txt", n++, " ", m); if (n==1000, break)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 23 2009]
|
|
CROSSREFS
|
Sequence in context: A043749 A043757 A043766 this_sequence A161155 A078621 A076195
Adjacent sequences: A063476 A063477 A063478 this_sequence A063480 A063481 A063482
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Jason Earls (zevi_35711(AT)yahoo.com), Jul 28 2001
|
|
|
Search completed in 0.002 seconds
|
