Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A053566
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A053566 A second order recursive sequence. +0
1
-2, -1, 12, 81, 378, 1539, 5832, 21141, 74358, 255879, 866052, 2893401, 9565938, 31355019, 102036672, 330024861, 1061819118, 3400690959, 10847773692, 34480423521, 109252577898, 345191655699 (list; graph; listen)
OFFSET

0,1

REFERENCES

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

FORMULA

a(n)=(3^(n-1))(5n-6).

EXAMPLE

a(n)=6a(n-1)-9a(n-2); a(0)=-2, a(1)=-1.

CROSSREFS

Cf. A023444.

Adjacent sequences: A053563 A053564 A053565 this_sequence A053567 A053568 A053569

Sequence in context: A012590 A012291 A012585 this_sequence A009483 A124916 A007418

KEYWORD

easy,sign

AUTHOR

Barry E. Williams, Jan 17 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 May 16 23:01 EDT 2008. Contains 139884 sequences.


AT&T Labs Research