login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A340625 a(n) = Sum_{d|n, d odd, d <= n/d} binomial(n/d, d). 2
1, 2, 3, 4, 5, 6, 7, 8, 10, 10, 11, 16, 13, 14, 25, 16, 17, 38, 19, 20, 56, 22, 23, 80, 26, 26, 111, 28, 29, 156, 31, 32, 198, 34, 56, 256, 37, 38, 325, 96, 41, 406, 43, 44, 626, 46, 47, 608, 50, 302, 731, 52, 53, 870, 517, 64, 1026, 58, 59, 1992, 61, 62, 1429, 64, 1352, 1606, 67, 68, 1840, 2192, 71, 2096, 73, 74 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
G.f.: (1/2) * Sum_{k >= 1} ((1 + x^k)^k - (1 - x^k)^k).
If p is prime, a(p) = p.
MATHEMATICA
a[n_] := DivisorSum[n, Binomial[n/#, #] &, OddQ[#] &]; Array[a, 75] (* Amiram Eldar, Apr 25 2021 *)
PROG
(PARI) a(n) = sumdiv(n, d, (d%2)*binomial(n/d, d));
(PARI) N=99; x='x+O('x^N); Vec(sum(k=1, N, (1+x^k)^k-(1-x^k)^k)/2)
CROSSREFS
Sequence in context: A073295 A191656 A266190 * A347644 A265572 A265556
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Apr 25 2021
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 28 03:36 EDT 2024. Contains 375477 sequences. (Running on oeis4.)