Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #12 Mar 16 2016 03:39:57
%S 1,2,3,4,8,13,16,20,26,32,44,48,64,75,76,112,128,132,176,208,252,256,
%T 308,368,512,541,544,576,604,768,818,976,1024,1076,1280,1376,1460,
%U 1888,2048,2208,2316,2496,2568,2612,2816,3172,3392,3408,4096,4683,5536,5740
%N Gozinta numbers: possible number of gozinta chains for some positive integer.
%C A gozinta chain for n is a sequence (1,a,b,...,n) where each element properly divides the next.
%H D. Wilson, <a href="/A034776/b034776.txt">Table of n, a(n) for n = 1..10000</a>
%H Project Euler, <a href="https://projecteuler.net/problem=548">Problem 548: Gozinta Chains</a>.
%Y Range of A002033, also odd elements form A000670.
%K nonn
%O 1,2
%A _David W. Wilson_