cp's OEIS Frontend

A352079 The number of nonnegative integers that have a shortest divisor addition chain of length n.

%I A352079 #20 Mar 03 2022 17:05:42
%S A352079 1,1,2,3,5,9,14,25,41,76,128,229,389,710,1238,2258,3986,7211,13000,
%T A352079 23609,42839,78271,142924,262541,481347,887753,1637365,3027681,
%U A352079 5604228,10397802
%N A352079 The number of nonnegative integers that have a shortest divisor addition chain of length n.
%C A352079 The number of occurrences of n in A117497.
%p A352079 A352079 := proc(n)
%p A352079     a := 0 ;
%p A352079     for c from 1 to 2^n do
%p A352079         if A117497(c) = n then
%p A352079             a := a+1 ;
%p A352079         end if;
%p A352079     end do:
%p A352079 end proc:
%p A352079 for n from 0 do
%p A352079     printf("%d\n",A352079(n)) ;
%p A352079 end do:
%Y A352079 Cf. A117497.
%K A352079 nonn,more
%O A352079 0,3
%A A352079 _R. J. Mathar_, Mar 02 2022
%E A352079 a(24)-a(29) from _Chai Wah Wu_, Mar 03 2022