|
Search: id:A079482
|
|
|
| A079482 |
|
Smallest number k such that k and k+1 have n and n+1 distinct prime divisors. |
|
+0
1
|
|
| 5, 65, 1364, 40754, 1774409, 58524465, 5327923964, 555409903685, 70367042561529, 5819629108725509, 567969628457303709
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
a(3) = 1364 because 1364 has 3 and 1365 has 4 distinct prime divisors.
|
|
PROGRAM
|
(PARI) for(n=1, 10, k=1; while(omega(k)!=n || omega(k+1)!=n+1, k++); print1(k", "))
|
|
CROSSREFS
|
Cf. A001221.
Sequence in context: A006278 A121822 A056245 this_sequence A147625 A157097 A046881
Adjacent sequences: A079479 A079480 A079481 this_sequence A079483 A079484 A079485
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
Jason Earls (zevi_35711(AT)yahoo.com), Jan 16 2003
|
|
EXTENSIONS
|
One more term from Ryan Propper (rpropper(AT)stanford.edu), Jul 21 2006
a(7),a(8) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Apr 05 2008
a(9)-a(11) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Feb 04 2009
|
|
|
Search completed in 0.002 seconds
|
