Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A123618
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A123618 a(n) = A123610(2*n+2,n). +0
6
1, 4, 39, 392, 4420, 52272, 644231, 8179600, 106376580, 1410528080, 19006875580, 259613952864, 3587352778256, 50068405195200, 704925148185495, 10001318622631200, 142866058397606500, 2053248549639210000 (list; graph; listen)
OFFSET

0,2

COMMENT

Related sequences: A123610(2n,n) = A123617(n); A123610(2n+1,n) = A000891(n); A123610(2n+2,n)/(n+1) = A123619(n). a(n) is divisible by (n+1): a(n)/(n+1) = A123619(n).

PROGRAM

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

CROSSREFS

Cf. A123610 (triangle); A123617, A000891, A123619.

Sequence in context: A059945 A093851 A063035 this_sequence A046449 A068187 A024055

Adjacent sequences: A123615 A123616 A123617 this_sequence A123619 A123620 A123621

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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research