The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A217728 a(n) = a(n-1)^3 + a(n-2)^3 - (a(n-1) - a(n-2))^3, a(1) = a(2) = 1. 0

%I #15 Mar 25 2013 12:45:56

%S 1,1,2,8,304,2160640,4256950094225408,

%T 117462917657284681348398871061442068480

%N a(n) = a(n-1)^3 + a(n-2)^3 - (a(n-1) - a(n-2))^3, a(1) = a(2) = 1.

%C a(9) has 93 digits and thus is too long to be added. - _Giovanni Resta_, Mar 22 2013

%e a(3) = (1)^3 + (1)^3 - (1-1)^3 = 2.

%e a(4) = (2)^3 + (1)^3 - (2 - 1)^3 = 8.

%e a(5) = (8)^3 + (2)^3 - (8 - 2)^3 = 512 + 8 - 216 = 304.

%K nonn

%O 1,3

%A _Gregory Gabovich_, Mar 21 2013

%E a(8) from _Giovanni Resta_, Mar 22 2013

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 8 07:12 EST 2023. Contains 367662 sequences. (Running on oeis4.)