Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A163446
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A163446 a(n) = 16*a(n-1)-62*a(n-2) for n > 1; a(0) = 1, a(1) = 10. +0
3
1, 10, 98, 948, 9092, 86696, 823432, 7799760, 73743376, 696308896, 6568853024, 61930496832, 583619061824, 5498214185600, 51787045136512, 487703442676992, 4592458284368128, 43241719103916544, 407135092031840768 (list; graph; listen)
OFFSET

0,2

COMMENT

Binomial transform of A163445. Inverse binomial transform of A163447.

FORMULA

a(n) = ((1+sqrt(2))*(8+sqrt(2))^n+(1-sqrt(2))*(8-sqrt(2))^n)/2.

G.f.: (1-6*x)/(1-16*x+62*x^2).

PROGRAM

(MAGMA) [ n le 2 select 9*n-8 else 16*Self(n-1)-62*Self(n-2): n in [1..19] ];

CROSSREFS

Cf. A163445, A163447.

Sequence in context: A158513 A125880 A125445 this_sequence A007137 A135927 A129542

Adjacent sequences: A163443 A163444 A163445 this_sequence A163447 A163448 A163449

KEYWORD

nonn

AUTHOR

Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Jul 27 2009

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 | The OEIS Foundation | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified March 20 09:10 EDT 2010. Contains 173642 sequences.


AT&T Labs Research