Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A133673
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A133673 a(n) = n*L(n) + (n-1)*L(n-1) where L(n) is the Lucas number. +0
1
7, 18, 40, 83, 163, 311, 579, 1060, 1914, 3419, 6053, 10637, 18575, 32262, 55772, 96019, 164711, 281635, 480171, 816536 (list; graph; listen)
OFFSET

2,1

COMMENT

For n>2, two evens followed by four odds.

FORMULA

G.f.: -x^2*(-7-4*x+3*x^2+x^3)/(x^2+x-1)^2. a(n)=2*a(n-1)+a(n-2)-2*a(n-3)-a(n-4). a(n)=A146005(n)+A146005(n-1). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 08 2009, Jul 13 2009]

EXAMPLE

If n=2 then a(n) = 7

If n=21 then a(n) = 816536

CROSSREFS

Cf. A000032, A136376.

Adjacent sequences: A133670 A133671 A133672 this_sequence A133674 A133675 A133676

Sequence in context: A156619 A033537 A000566 this_sequence A023166 A002764 A124053

KEYWORD

nonn

AUTHOR

Parthasarathy Nambi (PachaNambi(AT)yahoo.com), Dec 29 2007

EXTENSIONS

Typo in A-numbers corrected by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 13 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 | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 9 12:23 EST 2009. Contains 166233 sequences.


AT&T Labs Research