Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A066768
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A066768 Sum_{d|n} binomial(2*d-2,d-1). +0
2
1, 3, 7, 23, 71, 261, 925, 3455, 12877, 48693, 184757, 705713, 2704157, 10401527, 40116677, 155120975, 601080391, 2333619351, 9075135301, 35345312513, 137846529751, 538258059199, 2104098963721, 8233431436745, 32247603683171 (list; graph; listen)
OFFSET

1,2

FORMULA

Equals A051731 * A000984, i.e. the inverse Mobius transform of A000984. - Gary W. Adamson (qntmpkt(AT)yahoo.com), Nov 09 2007

PROGRAM

(PARI) a(n)=if(n<1, 0, sumdiv(n, d, binomial(2*d-2, d-1)))

CROSSREFS

Cf. A034731, A052854.

Cf. A051731, A000984.

Sequence in context: A045610 A045723 A140456 this_sequence A062241 A000229 A133435

Adjacent sequences: A066765 A066766 A066767 this_sequence A066769 A066770 A066771

KEYWORD

nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)eunet.rs), Jan 17 2002

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research