Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A104675
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A104675 C(n+1,n+0)*C(n+6,1) +0
2
6, 14, 24, 36, 50, 66, 84, 104, 126, 150, 176, 204, 234, 266, 300, 336, 374, 414, 456, 500, 546, 594, 644, 696, 750, 806, 864, 924, 986, 1050, 1116, 1184, 1254, 1326, 1400, 1476, 1554 (list; graph; listen)
OFFSET

0,1

FORMULA

a(n) = (n+1)(n+6) = A028557(n+1) . - R. J. Mathar (mathar(AT).strw.leidenuniv.nl), May 19 2008

a(n)=2*n+a(n-1)+4 (with a(1)=6) [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Nov 08 2009]

EXAMPLE

If n=0 then C(0+1,0+0)*C(0+6,1)= C(1,0)*C(6,1)=1*6=6

If n=5 then C(5+1,5+0)*C(5+6,1)= C(6,5)*C(11,1)=6*11=66

For n=2, a(2)=2*2+6+4=14; n=3, a(3)=2*3+14+4=24; n=4, a(4)=2*4+24+4=36 [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Nov 08 2009]

MAPLE

with (combinat):seq(fibonacci(3, n)+n-7, n=3..40); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jun 07 2008

with(finance):seq(add(cashflows([2, k, k], 0 ), k=2..n), n=2..38); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jun 22 2008

CROSSREFS

Cf. A062190.

Cf. A002522.

Sequence in context: A005281 A120345 A107400 this_sequence A028557 A083657 A010740

Adjacent sequences: A104672 A104673 A104674 this_sequence A104676 A104677 A104678

KEYWORD

easy,nonn

AUTHOR

Zerinvary Lajos (zlaja(AT)freemail.hu), Apr 22 2005

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 18 21:37 EST 2009. Contains 171024 sequences.


AT&T Labs Research