Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A069874
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A069874 a(1) = a(2) = 1; a(n) = 2^a(n-1) + 2^a(n-2) for n > 2. +0
1
1, 1, 4, 18, 262160 (list; graph; listen)
OFFSET

1,3

MATHEMATICA

a[n_] := 1 /; n == 1 a[n_] := 1 /; n == 2 a[n_] := 2^a[n - 1] + 2^a[n - 2] /; n > 2; Table[a[i], {i, 1, 6}]

CROSSREFS

Adjacent sequences: A069871 A069872 A069873 this_sequence A069875 A069876 A069877

Sequence in context: A086400 A082022 A114574 this_sequence A012496 A024572 A009267

KEYWORD

nonn

AUTHOR

Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Apr 23 2002

EXTENSIONS

a(6) has 78919 digits.

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 October 13 20:18 EDT 2008. Contains 145016 sequences.


AT&T Labs Research