|
%I #16 Dec 31 2019 06:29:59
%S 0,0,1,0,1,0,1,0,1,1,2,1,1,1,1,0,1,2,2,2,2,0,2,1,1,2,2,0,1,1,1,0,1,3,
%T 3,3,3,3,3,2,2,3,4,2,2,2,3,1,1,3,2,1,2,2,3,1,1,2,2,1,1,1,1,0,1,4,4,4,
%U 3,5,5,3,3,4,4,4,4,5,5,2,2,5,4,4,4,0,4
%N a(n) is the number of ways of writing the binary expansion of n as a product (or concatenation) of nonpalindromes.
%C This sequence is a variant of A215244.
%H Rémy Sigrist, <a href="/A330720/b330720.txt">Table of n, a(n) for n = 0..8192</a>
%H <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%F a(2^k-1) = 0 for any k >= 0.
%F a(A020988(k+1)) = 2^k for any k >= 0.
%e For n = 41:
%e - the binary expansion of 41 is "101001",
%e - the possible products of nonpalindromes are "101001", "1010"."01", and "10"."10"."01",
%e - hence a(41) = 3.
%p ispali:= proc(L) L = ListTools:-Reverse(L) end proc:
%p g:= proc(L) option remember; local m;
%p add(procname(L[m+1..-1]), m= remove(t -> ispali(L[1..t]),[$1..nops(L)]))
%p end proc:
%p g([]):= 1:
%p seq(g(convert(n,base,2)),n=0..100); # _Robert Israel_, Dec 29 2019
%o (PARI) a(n) = my (b=binary(n), v=b!=Vecrev(b)); for (s=1, #b, my (z=b[s..#b]); if (z!=Vecrev(z), v+=a(fromdigits(b[1..s-1],2)))); v
%Y Cf. A020988, A154809, A215244, A301453.
%K nonn,base,look
%O 0,11
%A _Rémy Sigrist_, Dec 28 2019
|
