The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A144818 Shifts left when Dirichlet convolution with a (DC:(b,a)->c) applied 4 times. 2
 1, 1, 5, 25, 135, 675, 3475, 17375, 87385, 437175, 2188575, 10942875, 54730525, 273652625, 1368332625, 6841676625, 34208737630, 171043688150, 855220256700, 4276101283500, 21380515232550, 106902576510250, 534512926322750 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS Alois P. Heinz, Table of n, a(n) for n = 1..1000 N. J. A. Sloane, Transforms MAPLE with(numtheory): dc:= proc(b, c) proc(n) option remember; add(b(d) *c(n/d), d=`if`(n<0, {}, divisors(n))) end end: A:= proc(n, k) local a, b, t; b[1]:= dc(a, a); for t from 2 to k do b[t]:= dc(b[t-1], a) od: a:= n-> `if`(n=1, 1, b[k](n-1)); a(n) end: a:= n-> A(n, 4): seq(a(n), n=1..30); MATHEMATICA dc[b_, c_] := Module[{f}, f[n_] := f[n] = Sum[b[d] c[n/d], {d, If[n<0, {}, Divisors[n]]}]; f]; A[n_, k_] := Module[{a, b, t}, b[1] = dc[a, a]; For[t = 2, t <= k, t++, b[t] = dc[b[t-1], a]]; a = Function[m, If[m= 1, 1, b[k][m-1]]]; a[n]]; a[n_] := A[n, 4]; Array[a, 30] (* Jean-François Alcover, Dec 18 2020, after Maple *) CROSSREFS 4th column of A144823. Sequence in context: A225963 A222570 A344268 * A048370 A272706 A275905 Adjacent sequences:  A144815 A144816 A144817 * A144819 A144820 A144821 KEYWORD eigen,nonn AUTHOR Alois P. Heinz, Sep 21 2008 STATUS approved

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

Last modified June 24 07:56 EDT 2021. Contains 345416 sequences. (Running on oeis4.)