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

Search: id:a333453
Showing 1-1 of 1

%I A333453 #17 Mar 27 2020 16:38:05
%S A333453 0,1,1,0,1,1,3,0,3,3,5,1,1,3,7,1,15,14,5,18,9,12,3,14,11,15,17,17,1,
%T A333453 20,11,0,11,11,17,3,5,23,37,37,5,29,27,33,27,6,35,4,3,28,15,49,19,46,
%U A333453 33,13,25,14,9,40,49,4,57,19,57,23,11,40,39,52,7,3,31
%N A333453 Binary concatenation (ignoring leading zeros) of a(n-1) and a(n-2) mod n, starting with a(n) = n for n <= 1.
%C A333453 Value 0 is treated as empty bit string.
%H A333453 Alois P. Heinz, <a href="/A333453/b333453.txt">Table of n, a(n) for n = 0..32768</a>
%F A333453 a(n) = (a(n-1)*A062383(a(n-2)) + a(n-2)) mod n if n > 1, a(n) = n if n < 2.
%e A333453 a(18) = 5 = 239 mod 18, where 239 = 11101111_2 is the binary concatenation 1110_2 = 14 = a(17) and 1111_2 = 15 = a(16).
%p A333453 a:= proc(n) option remember; `if`(n<2, n, (t-> a(n-1)*
%p A333453       `if`(t=0, 1, 2^(ilog2(t)+1))+t)(a(n-2)) mod n)
%p A333453     end:
%p A333453 seq(a(n), n=0..100);
%Y A333453 Cf. A062383, A063896, A079777.
%K A333453 nonn,base
%O A333453 0,7
%A A333453 _Alois P. Heinz_, Mar 21 2020

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