login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

a(n) = (A253079(n)-1)/4.
2

%I #10 May 17 2021 14:47:08

%S 0,1,3,4,8,5,16,16,24,15,36,38,44,37,64,62,86,59,108,102,116,97,150,

%T 130,186,125,224,178,224,177,270,230,320,219,370,280,376,281,454,348,

%U 498,327,552,394,600,413,624,488,746,475,790,556,842,585,884,636,1010

%N a(n) = (A253079(n)-1)/4.

%C It almost looks like one should be able to guess a recurrence. It would be nice to know more.

%H <a href="/index/Ce#cell">Index entries for sequences related to cellular automata</a>

%Y Cf. A253079, A253080.

%K nonn

%O 0,3

%A _N. J. A. Sloane_, Feb 04 2015