0,3

a(n+1)/A002605(n) converges to sqrt(3). - Mario Catalani (mario.catalani(AT)unito.it), Apr 22 2003

Binomial transform of expansion of cosh(sqrt(3)x) (A000244 with interpolated zeros); inverse binomial transform of A001075 . - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Jul 04 2005

The same sequence may be obtained by the following process. Starting a priori with the fraction 1/1, the numerators of fractions built according to the rule: add top and bottom to get the new bottom, add top and 3 times the bottom to get the new top. The limit of the sequence of fractions is sqrt(3). - Cino Hilliard (hillcino368(AT)gmail.com), Sep 25 2005

[1,3; 1,1]^n * [1,0] = [A026150(n), A002605(n)]. - Gary W. Adamson (qntmpkt(AT)yahoo.com), Mar 21 2008

(1+sqrt(3))^n = A026150(n) + A002605(n)*(sqrt(3)). - Gary W. Adamson (qntmpkt(AT)yahoo.com), Mar 21 2008

John Derbyshire, Prime Obsession, Joseph Henry Press, April 2004, see p. 16.

Tanya Khovanova, Recursive Sequences

C. Banderier and D. Merlini, Lattice paths with an infinite set of jumps, FPSAC02, Melbourne, 2002.

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 1052

A. Burstein, S. Kitaev and T. Mansour, Independent sets in certain classes of (almost) regular graphs

Zerinvary Lajos, Sage Notebooks

a(n)=(1/2)*((1+sqrt(3))^n+(1-sqrt(3))^n) - Benoit Cloitre (benoit7848c(AT)orange.fr), Oct 28 2002

G.f.: (1-x)/(1-2x-2x^2).

a(n)=a(n-1)+A083337(n-1). A083337(n)/a(n) converges to sqrt(3). - Mario Catalani (mario.catalani(AT)unito.it), Apr 29 2003

a(n)=sum{k=0..floor(n/2), C(n, 2k)3^k }; E.g.f.: exp(x)cosh(sqrt(3)x). - Paul Barry (pbarry(AT)wit.ie), May 15 2003

a(n+1)/a(n) converges to 1+sqrt(3) = 2.732050807568877293.... - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Jul 03 2005

Inverse binomial transform of A001075: (1, 2, 7, 26, 97, 362,...). - Gary W. Adamson (qntmpkt(AT)yahoo.com), Nov 23 2007

Starting (1, 4, 10, 28, 76,...), = binomial transform of [1, 3, 3, 9, 9, 27, 27, 81, 81,...]; and inverse binomial transform of A001834: (1, 5, 19, 71, 265,...). - Gary W. Adamson (qntmpkt(AT)yahoo.com), Nov 30 2007

a(n)=Sum_{k, 0<=k<=n}A098158(n,k)*3^(n-k). - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Dec 26 2007

a(n) = upper left and lower right terms of [1,1; 3,1]^n. (1+sqrt(3))^n = a(n) + A083337(n)/(sqrt(3)). - Gary W. Adamson (qntmpkt(AT)yahoo.com), Mar 12 2008

with(combstruct):ZL0:=S=Prod(Sequence(Prod(a, Sequence(b))), a):ZL1:=Prod(begin_blockP, Z, end_blockP):ZL2:=Prod(begin_blockLR, Z, Sequence(Prod(mu_length, Z), card>=1), end_blockLR): ZL3:=Prod(begin_blockRL, Sequence(Prod(mu_length, Z), card>=1), Z, end_blockRL):Q:=subs([a=Union(ZL2, ZL2, ZL2), b=ZL1], ZL0), begin_blockP=Epsilon, end_blockP=Epsilon, begin_blockLR=Epsilon, end_blockLR=Epsilon, begin_blockRL=Epsilon, end_blockRL=Epsilon, mu_length=Epsilon:temp15:=draw([S, {Q}, unlabelled], size=15):seq(count([S, {Q}, unlabelled], size=n)/3, n=2..27); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 08 2008

Expand[Table[((1 + Sqrt[3])^n + (1 - Sqrt[3])^n)/(2), {n, 0, 30}]] - Artur Jasinski (grafix(AT)csl.pl), Dec 10 2006

(PARI) a(n)=if(n<0, 0, real((1+quadgen(12))^n))

sage: from sage.combinat.sloane_functions import recur_gen2 sage: it = recur_gen2(1, 1, 2, 2) sage: [it.next() for i in range(30)] - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jun 25 2008

First differences of A080953.

The following sequences (and others) belong to the same family: A001333, A000129, A026150, A002605, A046717, A015518, A084057, A063727, A002533, A002532, A083098, A083099, A083100, A015519.

Cf. A001075.

Cf. A001834.

Cf. A083337.

Cf. A002605.

Sequence in context: A026534 A111308 A121302 this_sequence A026123 A091468 A103457

Adjacent sequences: A026147 A026148 A026149 this_sequence A026151 A026152 A026153

nonn

njas