# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a122954
Showing 1-1 of 1

%I A122954 #19 Apr 12 2019 08:13:41
%S A122954 1,1,2,3,3,5,4,4,5,5,8,7,8,6,5,7,7,5,7,10,9,11,15,10,9,13,13,12,17,11,
%T A122954 9,7,7,8,11,8,13,11,16,16,15,10,17,18,18,21,22,15,15,14,12,19,18,19,
%U A122954 24,22,20,24,25,21,25,17,14,11,11,11,13,12,17,16,21,15,11,19,26,17,23,22,24
%N A122954 a(1) = 1. a(n) = number of earlier terms which, when written in binary, are substrings of binary n.
%C A122954 First occurrence of k: 1, 3, 4, 7, 6, 14, 12, 11, 21, 20, 22, 28, 26, 50, 23, 39, 29, 44, 52, 57, 46, 47, 77, 55, 59, ...
%H A122954 Robert Israel, <a href="/A122954/b122954.txt">Table of n, a(n) for n = 1..10000</a>
%e A122954 Binary a(1) = 1, binary a(2) = 1, binary a(3) = 10, binary a(7) = 100 and binary a(8) = 100 are all substrings of binary 9 = 1001. So a(9) = 5.
%p A122954 A[1]:= 1:
%p A122954 S[1]:= "1":
%p A122954 for n from 2 to 100 do
%p A122954   B:= convert(convert(n,binary),string);
%p A122954   A[n]:= nops(select(t -> SearchText(S[t],B)>0, [$1..n-1]));
%p A122954   S[n]:= convert(convert(A[n],binary),string);
%p A122954 od:
%p A122954 seq(A[i],i=1..100); # _Robert Israel_, Apr 11 2019
%t A122954 f[ s_ ] := Append[ s, Length@ Select[ s, StringPosition[ ToString@ FromDigits@ IntegerDigits[ Length@s + 1, 2 ], ToString@ FromDigits@ IntegerDigits[ #, 2 ] ] != {} & ] ]; Nest[ f, {1}, 79 ] (* _Robert G. Wilson v_, Nov 01 2006 *)
%K A122954 nonn,look
%O A122954 1,3
%A A122954 _Leroy Quet_, Oct 25 2006
%E A122954 More terms from _Robert G. Wilson v_, Nov 01 2006

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE