Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A038762
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A038762 a(n)=6a(n-1)-a(n-2) for n >= 2, with a(0)=3, a(1)=13. +0
3
3, 13, 75, 437, 2547, 14845, 86523, 504293, 2939235, 17131117, 99847467, 581953685, 3391874643, 19769294173, 115223890395, 671574048197, 3914220398787, 22813748344525, 132968269668363, 774995869665653 (list; graph; listen)
OFFSET

0,1

COMMENT

A Pellian-related sequence.

a(n)={13*([3+2*sqrt(2)]^n -[3-2*sqrt(2)]^n)-3*([3+2*sqrt(2)]^(n-1) - [3-2*sqrt(2)]^(n-1))}/(4*sqrt(2)).

REFERENCES

A. H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, pp. 122-125, 194-196.

M. J. DeLeon, Pell's Equation and Pell Number Triples, Fib. Quart., 14(1976), pp. 456-460.

LINKS

Index entries for sequences related to linear recurrences with constant coefficients

Tanya Khovanova, Recursive Sequences

FORMULA

Equals sqrt{2*(A038761)^2+7}.

a(n) = 7*a(n-1) - 7*a(n-2) + a(n-3); a(n) = (1/2)*(3+sqrt(2))*(3+2*sqrt(2))^(n-1)+(1/2)*(3-sqrt(2))*(3-2*sqrt(2))^(n-1). - Antonio A. Olivares (olivares14031(AT)yahoo.com), Apr 20 2008

G.f.: (3-x)/(1-6*x+x^2). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Nov 03 2008]

CROSSREFS

Cf. A038761.

a(n) = A077443(2n) = A038725(n)+A038725(n+1).

Sequence in context: A020094 A009382 A110193 this_sequence A074517 A007178 A034172

Adjacent sequences: A038759 A038760 A038761 this_sequence A038763 A038764 A038765

KEYWORD

easy,nonn

AUTHOR

Barry E. Williams, May 03 2000

EXTENSIONS

More terms from James A. Sellers (sellersj(AT)math.psu.edu), May 04 2000

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research