Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A052215
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A052215
%S A052215 2,14,230,7314,378014,11243154,965009045,65893166030,5702759516090,
%T A052215 605247139068494,78971815814237709
%N A052215 a(n) = smallest number m such that m and m+1 are the product of exactly 
               n distinct primes.
%C A052215 2^63 < a(12) <= 22593106657425552170. [From Donovan Johnson (donovan.johnson(AT)yahoo.com), 
               Oct 23 2008]
%e A052215 14 and 15 are both the product of 2 primes
%e A052215 230 is the 3rd entry because we have (230=2*5*23, 231=3*7*11).
%Y A052215 Cf. A093548, A093549, A093550, A115186.
%Y A052215 Sequence in context: A118086 A048163 A093548 this_sequence A053846 A053855 
               A152476
%Y A052215 Adjacent sequences: A052212 A052213 A052214 this_sequence A052216 A052217 
               A052218
%K A052215 hard,nice,nonn
%O A052215 1,1
%A A052215 Erich Friedman (efriedma(AT)stetson.edu), Jan 29 2000
%E A052215 More terms from Naohiro Nomoto (6284968128(AT)geocities.co.jp), Jul 08 
               2001
%E A052215 a(7) from Farideh Firoozbakht (mymontain(AT)yahoo.com), Apr 06 2004
%E A052215 a(8)-a(10) from Martin Fuller (martin_n_fuller(AT)btinternet.com), Jan 
               17 2006
%E A052215 a(11) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Oct 23 2008

    
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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research