|
%I #10 Jan 25 2020 18:33:39
%S 1,1,2,1,2,1,2,1,2,2,1,2,4,6,14,1,2,2,2,4,10,1,2,2,8,12,6,11,6,13,30,
%T 3,4,33,8,4,9,5,6,7,20,5,2,2,6,6,2,5,12,4,18,19,20,6,22,23,12,6,26,14,
%U 28,61,2,1,8,8,8,67,8,17,4,35,8,9,10,11,12,6
%N a(1) = 1. a(n+1) = the largest positive integer that, when written in binary, occurs as a substring both in binary n and in binary A175302(n), where A175302(n) = Sum_{k=1..n} a(k).
%H Rémy Sigrist, <a href="/A175301/b175301.txt">Table of n, a(n) for n = 1..16384</a>
%H Rémy Sigrist, <a href="/A175301/a175301.gp.txt">PARI program for A175301</a>
%e The sum of the first 13 terms of this sequence is 22, which is 10110 in binary. 13 in binary is 1101. The largest integer that, when written in binary, occurs in both of these binary representations is 6, which is 110 in binary. So, a(14) = 6.
%o (PARI) See Links section.
%Y Cf. A175302.
%K base,nonn
%O 1,3
%A _Leroy Quet_, Mar 24 2010
%E More terms from _Rémy Sigrist_, Jan 25 2020
|
