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!)
A318123 a(0) = a(1) = 1; a(n) = Sum_{k=0..n-2} lcm(a(k), a(n-k-2)). 1

%I #5 Aug 22 2018 02:32:18

%S 1,1,1,2,3,6,11,22,42,90,165,364,710,1586,2885,6288,12546,28686,55406,

%T 130284,261016,555716,1149559,2552096,5429610,11510594,23650462,

%U 54063580,109053128,262968892,501771275,1192348336,2635608642,5766609158,11935917602,28867050172,58702673480

%N a(0) = a(1) = 1; a(n) = Sum_{k=0..n-2} lcm(a(k), a(n-k-2)).

%H N. J. A. Sloane, <a href="/transforms.txt">Transforms</a>

%t a[0] = a[1] = 1; a[n_] := a[n] = Sum[LCM[a[k], a[n - k - 2]], {k, 0, n - 2}]; Table[a[n], {n, 0, 36}]

%Y Cf. A007463, A007477, A318122.

%K nonn

%O 0,4

%A _Ilya Gutkovskiy_, Aug 18 2018

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 April 20 00:26 EDT 2024. Contains 371798 sequences. (Running on oeis4.)