Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A082096
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A082096 A 2nd order recursion: a(1)=a(2)=1; a(n)=p[a(n-2)+a(n-1)]=A000040[a(n-2)+a(n-1)]. +0
3
1, 1, 3, 7, 29, 151, 1069, 9887, 115891, 1666421, 28700933, 580669933, 13578126713, 362075579539 (list; graph; listen)
OFFSET

1,3

MATHEMATICA

f[x_] := Prime[f[x-2]+f[x-1]] {f[1]=1, f[2]=1}; Table[f[w], {w, 1, 25}]

CROSSREFS

Cf. A069103, A082094, A082095.

Sequence in context: A110613 A088095 A141477 this_sequence A119325 A048722 A061955

Adjacent sequences: A082093 A082094 A082095 this_sequence A082097 A082098 A082099

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Apr 11 2003

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 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research