Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A096101
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A096101
%S A096101 1,3,2,2,2,3,170,46600,1901907,65157236
%N A096101 a(1) = 1; for n > 1: a(n) = smallest number >1 such that product of any 
               two or more successive terms - 1 is prime.
%C A096101 Next term > 20000000 if it exists.
%e A096101 a(2) is not 2 since 1*2-1 = 1 is not prime, but 1*3-1 = 2 is prime, hence 
               a(2) = 3. a(6) is not 2 since 2*2*2*2-1 = 15 is not prime, but 2*3-1 
               = 5, 2*2*3-1 = 11, 2*2*2*3-1 = 23, 3*2*2*2*3-1 = 71 are all prime, 
               hence a(6) = 3.
%Y A096101 Cf. A096100.
%Y A096101 Sequence in context: A141070 A163751 A067279 this_sequence A104890 A064123 
               A024703
%Y A096101 Adjacent sequences: A096098 A096099 A096100 this_sequence A096102 A096103 
               A096104
%K A096101 more,nonn
%O A096101 1,2
%A A096101 Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jun 24 2004
%E A096101 Edited and extended by Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), 
               Jul 05 2004
%E A096101 a(10) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Apr 22 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 December 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research