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!)
A366473 a(1) = 1; thereafter a(n) = A337136(n) + A337136(n-1). 2

%I #8 Oct 26 2023 13:28:34

%S 1,3,5,8,9,10,14,15,16,19,29,48,41,53,94,67,81,82,31,47,78,60,31,80,

%T 82,42,43,64,67,158,160,51,42,44,38,39,58,62,66,67,234,237,75,74,72,

%U 75,78,82,86,90,91,94,97,145,147,101,152,153,106,110,111,112,115,81,83,143,148,129,127,190,193,259,263,333,332,137,205,212,147,149,226,223,297

%N a(1) = 1; thereafter a(n) = A337136(n) + A337136(n-1).

%H Michael De Vlieger, <a href="/A366473/b366473.txt">Table of n, a(n) for n = 1..10000</a>

%H Michael De Vlieger, <a href="/A366473/a366473.png">Log log scatterplot of a(n)</a>, n = 1..2^14, accentuating prime powers in red.

%t nn = 120;

%t c[_] := False;

%t Array[Set[{a[#], c[#]}, {#, True}] &, 2]; Set[{i, j, u},

%t Range[3]]; s = i + j;

%t Do[k = u;

%t While[Or[c[k], CoprimeQ[s, k]], k++];

%t Set[{a[n], c[k], i, j, s}, {s, True, j, k, j + k}];

%t If[k == u, While[c[u], u++]], {n, 2, nn}], n];

%t Array[a, nn] (* _Michael De Vlieger_, Oct 26 2023 *)

%Y Cf. A337136.

%K nonn

%O 1,2

%A _N. J. A. Sloane_, Oct 26 2023

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 May 11 23:16 EDT 2024. Contains 372431 sequences. (Running on oeis4.)