Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A105637
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A105637 a(n)=a(n-2)+a(n-3)-a(n-5). +0
1
0, 1, 2, 1, 3, 3, 3, 4, 5, 4, 6, 6, 6, 7, 8, 7, 9, 9, 9, 10, 11, 10, 12, 12, 12, 13, 14, 13, 15, 15, 15, 16, 17, 16, 18, 18, 18, 19, 20, 19, 21, 21, 21, 22, 23, 22, 24, 24, 24, 25, 26, 25, 27, 27, 27, 28, 29, 28, 30, 30, 30, 31, 32, 31, 33, 33, 33, 34, 35, 34, 36, 36, 36, 37, 38, 37 (list; graph; listen)
OFFSET

0,3

COMMENT

a(n+6) = a(n) + 3; convolution of A000035(n) with A010872(n). [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Mar 08 2009]

FORMULA

G.f.: x(1+2x)/((1-x^2)(1-x^3)); a(n)=sum{k=0..n, mod(k, 3)*(1-(-1)^(n+k-1))/2}; a(n)=sum{k=0..floor(n/2), mod(n-2k, 3)}.

CROSSREFS

Sequence in context: A038565 A085599 A110425 this_sequence A029161 A035384 A153868

Adjacent sequences: A105634 A105635 A105636 this_sequence A105638 A105639 A105640

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Apr 16 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 11 12:57 EST 2009. Contains 170656 sequences.


AT&T Labs Research