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

 

Logo

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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A065692 Braided power sequence: this is b(n+1)=3b(n)+2d(n)-c(n), A065693 is c(n+1)=3c(n)+2b(n)-d(n) and A065694 is d(n+1)=3d(n)+2c(n)-b(n), starting with b(0)=0, c(0)=1 and d(0)=2. 2
0, 3, 24, 117, 417, 1140, 2583, 7311, 39840, 251613, 1329969, 5738172, 20838447, 67344735, 216818808, 812592261, 3660235905, 17401156548, 78077421639, 318790895727, 1197423287952, 4316735957805, 15912781695633 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

Tends to 4^n. "Braided" because the order of b(n), c(n) and d(n) changes between the six possibilities as n increases.

LINKS

Table of n, a(n) for n=0..22.

FORMULA

Conjectures from Colin Barker, Sep 02 2016: (Start)

a(n) = 9*a(n-1)-33*a(n-2)+52*a(n-3) for n>2.

G.f.: 3*x*(1-x) / ((1-4*x)*(1-5*x+13*x^2)).

(End)

EXAMPLE

a(1) = 3*0+2*2-1*1 = 3.

CROSSREFS

Cf. A065693, A065694.

Sequence in context: A050545 A253944 A139031 * A127520 A175115 A301812

Adjacent sequences:  A065689 A065690 A065691 * A065693 A065694 A065695

KEYWORD

nonn

AUTHOR

Henry Bottomley, Nov 14 2001

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 December 8 00:04 EST 2021. Contains 349590 sequences. (Running on oeis4.)