Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A100477
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A100477 a(n) = 3*a(n-1)+2*a(n-2)+a(n-3) if n>=3 else a(n)=n +0
2
0, 1, 2, 8, 29, 105, 381, 1382, 5013, 18184, 65960, 239261, 867887, 3148143, 11419464, 41422565, 150254766, 545028892, 1977018773, 7171368869, 26013173045, 94359275646, 342275541897, 1241558350028, 4503585409524 (list; graph; listen)
OFFSET

0,3

COMMENT

Weighted sum of the three previous terms.

FORMULA

O.g.f.: x(1-x)/(1-3x-2x^2-x^3). a(n)=A108153(n)-A108153(n-1). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 22 2008]

EXAMPLE

a(3)= 3*a(2)+2*a(1)+a(0) = 3*2+2*1+0 = 8

PROGRAM

(PERL) #!/usr/local/bin/perl -w $d=0; $c=1; $b=2; print "$d, $c, $b, "; $a=0; for (; ; ){ $a=3*$b+2*$c+$d; $d=$c; $c=$b; $b=$a; print "$a, "; last if ($a >2**61); } __END__

CROSSREFS

Adjacent sequences: A100474 A100475 A100476 this_sequence A100478 A100479 A100480

Sequence in context: A061230 A013559 A107025 this_sequence A011367 A009419 A000162

KEYWORD

easy,nonn

AUTHOR

gamo (gamo(AT)telecable.es), Nov 22 2004

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 October 7 08:31 EDT 2008. Contains 144667 sequences.


AT&T Labs Research