Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A000280
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A000280 a(n) = a(n-1) + a(n-2)^3. +0
1
0, 1, 1, 2, 3, 11, 38, 1369, 56241, 2565782650, 177895665388171, 16891164530321501264425013171, 5629840598310484749297545401724540333537382 (list; graph; listen)
OFFSET

0,4

MAPLE

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

a[ -2]:=0: a[ -1]:=1:a[0]:=1: a[1]:=2: for n from 2 to 10 do a[n]:=a[n-1]+a[n-2]^3 od: seq(a[n], n=-2..10); # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 19 2009]

CROSSREFS

Sequence in context: A084121 A088747 A007756 this_sequence A046224 A081173 A055692

Adjacent sequences: A000277 A000278 A000279 this_sequence A000281 A000282 A000283

KEYWORD

nonn

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research