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!)
A034730 Dirichlet convolution of b_n=1 with c_n=3^(n-1). 14
1, 4, 10, 31, 82, 256, 730, 2218, 6571, 19768, 59050, 177430, 531442, 1595056, 4783060, 14351125, 43046722, 129146980, 387420490, 1162281262, 3486785140, 10460412256, 31381059610, 94143358444, 282429536563, 847289140888, 2541865834900, 7625599080070, 22876792454962 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
G.f.: Sum_{n>0} x^n/(1-3*x^n). - Vladeta Jovovic, Nov 14 2002
a(n) ~ 3^(n-2). - Vaclav Kotesovec, Sep 09 2014
a(n) = Sum_{d|n} 3^(d-1). - Seiichi Manyama, Jun 26 2019
MATHEMATICA
Rest[CoefficientList[Series[Sum[x^k/(1-3*x^k), {k, 1, 30}], {x, 0, 30}], x]] (* Vaclav Kotesovec, Sep 09 2014 *)
A034730[n_]:= DivisorSum[n, 3^(#-1) &];
Table[A034730[n], {n, 40}] (* G. C. Greubel, Jun 25 2024 *)
PROG
(PARI) {a(n) = sumdiv(n, d, 3^(d-1))} \\ Seiichi Manyama, Jun 26 2019
(Magma)
A034730:= func< n | (&+[3^(d-1): d in Divisors(n)]) >;
[A034730(n): n in [1..40]]; // G. C. Greubel, Jun 25 2024
(SageMath)
def A034730(n): return sum(3^(k-1) for k in (1..n) if (k).divides(n))
[A034730(n) for n in range(1, 41)] # G. C. Greubel, Jun 25 2024
CROSSREFS
Sums of the form Sum_{d|n} q^(d-1): A034729 (q=2), this sequence (q=3), A113999 (q=10), A339684 (q=4), A339685 (q=5), A339686 (q=6), A339687 (q=7), A339688 (q=8), A339689 (q=9).
Sequence in context: A333916 A264564 A304963 * A321143 A095127 A006342
KEYWORD
nonn
AUTHOR
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 September 4 11:41 EDT 2024. Contains 375683 sequences. (Running on oeis4.)