Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A000284
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A000284 a(n) = a(n-1)^3 + a(n-2). +0
1
0, 1, 1, 2, 9, 731, 390617900, 59601394712394173339000731 (list; graph; listen)
OFFSET

0,4

FORMULA

For n>0, a(n) = floor(c^(3^n)) where c=1.0275090796393628012075291021962112731026759143420911102331653107087209649910... - Gerald McGarvey (gerald.mcgarvey(AT)comcast.net), Nov 28 2007

MAPLE

A000284 := proc(n) option remember; if n <= 1 then n else A000284(n-2)+A000284(n-1)^3; fi; end;

CROSSREFS

Cf. A058182.

Adjacent sequences: A000281 A000282 A000283 this_sequence A000285 A000286 A000287

Sequence in context: A008322 A135361 A023366 this_sequence A112961 A114953 A067691

KEYWORD

nonn,easy

AUTHOR

greenfie(AT)math.rutgers.edu (Stephen J. Greenfield)

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 May 16 23:01 EDT 2008. Contains 139884 sequences.


AT&T Labs Research