Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A053537
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A053537 A second order recursive sequence. +0
2
1, 10, 175, 2500, 38125, 568750, 8546875, 128125000, 1922265625, 28832031250, 432490234375 (list; graph; listen)
OFFSET

0,2

REFERENCES

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

FORMULA

a(n)=(5^n/4)*[(3^(n+1))+(-1)^n].

EXAMPLE

a(n)=10a(n-1)+75a(n-2); a(0)=1.

CROSSREFS

Cf. A015518.

Sequence in context: A132676 A078516 A144516 this_sequence A049380 A057122 A113119

Adjacent sequences: A053534 A053535 A053536 this_sequence A053538 A053539 A053540

KEYWORD

easy,nonn

AUTHOR

Barry E. Williams, Jan 15 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 December 17 19:39 EST 2009. Contains 170821 sequences.


AT&T Labs Research