Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A123611
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A123611 Row sums of triangle A123610. +0
4
1, 2, 4, 8, 20, 52, 160, 492, 1620, 5408, 18504, 64132, 225440, 800048, 2865720, 10341208, 37568340, 137270956, 504176992, 1860277044, 6892335720, 25631327688, 95640894056, 357975249028, 1343650267296, 5056424257552 (list; graph; listen)
OFFSET

0,2

FORMULA

a(n) = 2*A047996(2*n,n) = 2*A003239(n) for n>0, where A047996 is the triangle of circular binomial coefficients and A003239(n) = number of rooted planar trees with n non-root nodes.

PROGRAM

(PARI) {a(n)=sum(k=0, n, if(k==0, 1, (1/n)*sumdiv(n, d, if(gcd(k, d)==d, eulerphi(d)*binomial(n/d, k/d)^2, 0))))}

CROSSREFS

Cf. A047996, A003239; A123610 (triangle), A123612 (antidiagonal sums); central terms: A123617, A123618.

Sequence in context: A078160 A089976 A000980 this_sequence A082279 A113180 A000116

Adjacent sequences: A123608 A123609 A123610 this_sequence A123612 A123613 A123614

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Oct 03 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 November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research