login
a(0) = 1; for n > 0, a(n) = A109812(n) + A109812(n+1).
2

%I #18 Nov 04 2023 12:28:27

%S 1,3,6,7,11,13,15,26,22,15,27,30,29,31,46,39,31,57,53,31,47,55,59,61,

%T 55,47,61,63,79,86,63,107,91,63,103,91,63,109,95,119,123,95,103,63,95,

%U 111,124,119,127,216,157,127,227,159,127,227,175,127,214,174,111

%N a(0) = 1; for n > 0, a(n) = A109812(n) + A109812(n+1).

%H N. J. A. Sloane, <a href="/A353240/b353240.txt">Table of n, a(n) for n = 0..20000</a> (first 10000 terms from Rémy Sigrist)

%H Rémy Sigrist, <a href="/A353240/a353240.txt">C++ program</a>.

%e a(7) = A109812(7) + A109812(8) = 10 + 16 = 26.

%o (C++) See Links section.

%Y Cf. A109812, A353241.

%K nonn

%O 0,2

%A _Rémy Sigrist_, Apr 08 2022