login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A074488 a(1)=1, then "jump over next cube": a(n) = 2*(a(n-1)+1)^3-a(n-1). 0
1, 15, 8177, 1093884103327, 2617845000308809034415180474721383777, 35880772304755070470965980424546414275930627947903988794595699467727630030276033995103117884255220637999070127 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

The rule "jump over next something" can be varied, see A075694, A075695.

LINKS

Table of n, a(n) for n=1..6.

FORMULA

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

EXAMPLE

a(1)=1; next cube is (a(1)+1)^3=8; "jump over" it: 8+(8-1)=15; a(2)=15; next cube is (a(2)+1)^3=4096; "jump over" it: 4096+(4096-15)=8177.

MAPLE

a(1) := 1; a(n) := 2*(a(n-1)+1)^2-a(n-1);

CROSSREFS

Cf. A075694, A075695.

Sequence in context: A205304 A334835 A206295 * A059950 A198979 A249967

Adjacent sequences:  A074485 A074486 A074487 * A074489 A074490 A074491

KEYWORD

easy,nonn

AUTHOR

Zak Seidov, Sep 26 2002

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 26 04:27 EDT 2021. Contains 348256 sequences. (Running on oeis4.)