login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A326663 Column 3 of the array at A309157; see Comments. 2

%I

%S 5,12,20,26,33,41,47,54,61,68,75,83,89,96,104,110,117,124,131,138,146,

%T 152,159,167,173,180,188,194,201,209,215,222,230,236,243,250,257,264,

%U 272,278,285,293,299,306,313,320,327,335,341,348,356,362,369,377,383

%N Column 3 of the array at A309157; see Comments.

%C This is the sequence (c(n)) defined by the complementary equation c(n) = a(n) + b(2n), with initial value a(1) = 1. See A309157. Conjecture: 7n-c(n) is in {1,2} for all n.

%H Clark Kimberling, <a href="/A326663/b326663.txt">Table of n, a(n) for n = 1..10000</a>

%t mex[list_, start_] := (NestWhile[# + 1 &, start, MemberQ[list, #] &]);

%t a = b = c = {}; h = 1; k = 2;

%t Do[Do[AppendTo[a,

%t mex[Flatten[{a, b, c}], Max[Last[a /. {} -> {0}], 1]]];

%t AppendTo[b, mex[Flatten[{a, b, c}], Max[Last[b /. {} -> {0}], 1]]], {k}];

%t AppendTo[c, a[[h Length[a]/k]] + Last[b]], {150}]; c

%t (* _Peter J. C. Moses_, July 04 2019 *)

%Y Cf. A309157.

%K nonn,tabl,easy

%O 1,1

%A _Clark Kimberling_, Jul 16 2019

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 21 16:04 EST 2019. Contains 329371 sequences. (Running on oeis4.)