Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A069101
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A069101
%S A069101 2,2,7,23,113
%N A069101 a(1) = 2; a(2) = 2; a(n) = Prime[a(n-1) + a(n-2)] if n > 2.
%e A069101 a(3) = Prime[a(2) + a(1)] = Prime[2 + 2] = Prime(4) = 7.
%Y A069101 Sequence in context: A049955 A156464 A156520 this_sequence A138802 A047003 
               A067352
%Y A069101 Adjacent sequences: A069098 A069099 A069100 this_sequence A069102 A069103 
               A069104
%K A069101 nonn
%O A069101 1,1
%A A069101 Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Apr 06 2002

    
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