# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a000284
Showing 1-1 of 1

%I A000284 #30 May 08 2020 17:39:57
%S A000284 0,1,1,2,9,731,390617900,59601394712394173339000731,
%T A000284 211723599072542785377729319366442939995427829921816290889198752331804918235791
%N A000284 a(n) = a(n-1)^3 + a(n-2) with a(0)=0, a(1)=1.
%H A000284 John Cerkan, <a href="/load/view.php?a=aHR0cDovL29laXMub3JnL0EwMDAyODQvYjAwMDI4NC50eHQ">Table of n, a(n) for n = 0..10</a>
%F A000284 For n>0, a(n) = floor(c^(3^n)) where c=1.0275090796393628012075291021962112731026759143420911102331653107087209649910... - _Gerald McGarvey_, Nov 28 2007
%p A000284 A000284 := proc(n) option remember; if n <= 1 then n else A000284(n-2)+A000284(n-1)^3; fi; end;
%p A000284 a[-2]:=0: a[-1]:=1: a[0]:=1: a[1]:=2: for n from 2 to 6 do a[n]:=a[n-1]^3+a[n-2] od: seq(a[n], n=-2..6); # _Zerinvary Lajos_, Mar 19 2009
%t A000284 RecurrenceTable[{a[n] == a[n-1]^3 + a[n-2], a[0] == 0, a[1] == 1}, a, {n, 0, 8}] (* _Jean-François Alcover_, Feb 06 2016 *)
%t A000284 nxt[{a_,b_}]:={b,b^3+a}; NestList[nxt,{0,1},9][[All,1]] (* _Harvey P. Dale_, May 08 2020 *)
%Y A000284 Cf. A058182.
%K A000284 nonn,easy
%O A000284 0,4
%A A000284 Stephen J. Greenfield (greenfie(AT)math.rutgers.edu)
%E A000284 a(9) from _Vincenzo Librandi_, Apr 26 2010

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE