Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A079482
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A079482
%S A079482 5,65,1364,40754,1774409,58524465,5327923964,555409903685,
%T A079482 70367042561529,5819629108725509,567969628457303709
%N A079482 Smallest number k such that k and k+1 have n and n+1 distinct prime divisors.
%e A079482 a(3) = 1364 because 1364 has 3 and 1365 has 4 distinct prime divisors.
%o A079482 (PARI) for(n=1,10,k=1; while(omega(k)!=n || omega(k+1)!=n+1,k++); print1(k",
               "))
%Y A079482 Cf. A001221.
%Y A079482 Sequence in context: A006278 A121822 A056245 this_sequence A147625 A157097 
               A046881
%Y A079482 Adjacent sequences: A079479 A079480 A079481 this_sequence A079483 A079484 
               A079485
%K A079482 more,nonn
%O A079482 1,1
%A A079482 Jason Earls (zevi_35711(AT)yahoo.com), Jan 16 2003
%E A079482 One more term from Ryan Propper (rpropper(AT)stanford.edu), Jul 21 2006
%E A079482 a(7),a(8) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Apr 05 
               2008
%E A079482 a(9)-a(11) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Feb 04 
               2009

    
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 16 17:18 EST 2009. Contains 170825 sequences.


AT&T Labs Research