Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A055269
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A055269 a(n)=4a(n-1)-a(n-2)+3; a(0)=1, a(1)=7. +0
1
1, 7, 30, 116, 437, 1635, 6106, 22792, 85065, 317471, 1184822, 4421820, 16502461, 61588027, 229849650, 857810576, 3201392657, 11947760055, 44589647566, 166410830212, 621053673285 (list; graph; listen)
OFFSET

0,2

REFERENCES

I. Adler, Three Diophantine equations - Part II, Fib. Quart., 7 (1969), pps. 181-193.

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

E. I. Emerson, Recurrent Sequences in the Equation DQ^2=R^2+N, Fib. Quart.,7 (1969), pps. 231-242.

FORMULA

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

EXAMPLE

G.f.=(1+2x)/(1-x)(1-4x+x^2). Also the first partial sum of A054491.

CROSSREFS

Cf. A001834 and A054491.

Sequence in context: A038798 A062455 A085277 this_sequence A026631 A037709 A037611

Adjacent sequences: A055266 A055267 A055268 this_sequence A055270 A055271 A055272

KEYWORD

easy,nonn

AUTHOR

Barry E. Williams, May 10 2000

EXTENSIONS

Corrected by T. D. Noe (noe(AT)sspectra.com), Nov 07 2006

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 December 4 08:07 EST 2009. Contains 170310 sequences.


AT&T Labs Research