Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A108583
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A108583
%S A108583 3,13,2593,2426113
%N A108583 Let b(n) = b(n-1)+A005185(n) [with what initial term?]; sequence gives 
               primes of the form 1 + Product_{i=1..k} b(i).
%C A108583 Using a sequence starting at 2 with a chaotic gap to simulate the primes, 
               this is a Euclid prime analog.
%F A108583 b(n) = b(n-1)+A005185[[n]] a(m)=if Product[b[n], {n, 1, m}]+1 is prime 
               then Product[b[n], {n, 1, m}]+1
%t A108583 Hofstadter[0] = Hofstadter[1] = 1 Hofstadter[n_Integer?Positive] := Hofstadter[n] 
               = Hofstadter[n - Hofstadter[n - 1]] + Hofstadter[n - Hofstadter[n 
               - 2]] a[1] = 2; a[n_] := a[n] = a[n - 1] + 2*Hofstadter[n] b = Flatten[Table[If[PrimeQ[Product[a[n], 
               {n, 1, m}] + 1] == True, Product[a[n], {n, 1, m}] + 1, {}], {m, 1, 
               200}]]
%Y A108583 Cf. A018239, A005185.
%Y A108583 Sequence in context: A006715 A138487 A022507 this_sequence A119987 A127855 
               A087333
%Y A108583 Adjacent sequences: A108580 A108581 A108582 this_sequence A108584 A108585 
               A108586
%K A108583 nonn
%O A108583 0,1
%A A108583 Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Jul 05 2005

    
page 1

Search completed in 0.003 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 5 08:23 EST 2009. Contains 170348 sequences.


AT&T Labs Research