Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A115364
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A115364 Follow the ruler function A001511(n) by binomial(n+2,2). +0
2
1, 3, 1, 6, 1, 3, 1, 10, 1, 3, 1, 6, 1, 3, 1, 15, 1, 3, 1, 6, 1, 3, 1, 10, 1, 3, 1, 6, 1, 3, 1, 21, 1, 3, 1, 6, 1, 3, 1, 10, 1, 3, 1, 6, 1, 3, 1, 15, 1, 3, 1, 6, 1, 3, 1, 10, 1, 3, 1, 6, 1, 3, 1, 28, 1, 3, 1, 6, 1, 3, 1, 10, 1, 3, 1, 6, 1, 3, 1, 15, 1, 3, 1, 6, 1, 3, 1, 10, 1, 3, 1, 6, 1 (list; graph; listen)
OFFSET

1,2

COMMENT

Row sums of A115363. In general, the row sums of ((1,x)-m(x,x^2))^(-2) are obtained by following the ruler function A001511(n) by the solution of the recurrence a(1)=1,a(n)=n*m^(n-1)+a(n-1),n>1.

FORMULA

a(n)=C(A001511(n)+2, 2).

Dirichlet g.f.: zeta(s)*[2^s/(2^s-1)]^2. - Ralf Stephan, Jun 17 2007

CROSSREFS

Adjacent sequences: A115361 A115362 A115363 this_sequence A115365 A115366 A115367

Sequence in context: A010287 A130270 A090049 this_sequence A016476 A068436 A019570

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Jan 21 2006

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 May 16 01:24 EDT 2008. Contains 139630 sequences.


AT&T Labs Research