Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A072263
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A072263 a(n) = 3 a(n-1) + 5 a(n-2). +0
1
3, 19, 72, 311, 1293, 5434, 22767, 95471, 400248, 1678099, 7035537, 29497106, 123669003, 518492539, 2173822632 (list; graph; listen)
OFFSET

1,1

COMMENT

If b(n)=A015523, a(n)=5*b(n-1)+b(n+1); b(n) is Fibonacci-type, a(n) is Lucas-type.

FORMULA

a(n)=[(3+sqrt(29))/2 ]^n + [ (3-sqrt(29))/2 ]^n.

EXAMPLE

a(5)=5*b(4)+b(6): 1293=5*57+1008

CROSSREFS

Cf. A015523.

Sequence in context: A064056 A059599 A095662 this_sequence A090698 A027175 A093734

Adjacent sequences: A072260 A072261 A072262 this_sequence A072264 A072265 A072266

KEYWORD

easy,nonn

AUTHOR

M. Kristof (kristmikl(AT)freemail.hu), Jul 08 2002

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research