Greetings from
The On-Line Encyclopedia of Integer Sequences
!
Hints
Search:
id:A086901
Displaying 1-1 of 1 results found.
page 1
Format:
long
| short |
internal
|
text
Sort: relevance |
references
|
number
Highlight: on |
off
A086901
a(1) = a(2) = 1; for n>2, a(n) = 4*a(n-1) + 3*a(n-2).
+0
4
1, 1, 7, 31, 145, 673, 3127, 14527, 67489, 313537, 1456615, 6767071, 31438129, 146053729, 678529303, 3152278399, 14644701505, 68035641217, 316076669383, 1468413601183, 6821884412881, 31692778455073, 147236767058935
(
list
;
graph
;
listen
)
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 8 08:17 EST 2009. Contains 170430 sequences.
AT&T Labs Research
Legal Notice
© 2009 AT&T Intellectual Property.
All Rights Reserved.
