This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A034776 #12 Mar 16 2016 03:39:57 %S A034776 1,2,3,4,8,13,16,20,26,32,44,48,64,75,76,112,128,132,176,208,252,256, %T A034776 308,368,512,541,544,576,604,768,818,976,1024,1076,1280,1376,1460, %U A034776 1888,2048,2208,2316,2496,2568,2612,2816,3172,3392,3408,4096,4683,5536,5740 %N A034776 Gozinta numbers: possible number of gozinta chains for some positive integer. %C A034776 A gozinta chain for n is a sequence (1,a,b,...,n) where each element properly divides the next. %H A034776 D. Wilson, <a href="/A034776/b034776.txt">Table of n, a(n) for n = 1..10000</a> %H A034776 Project Euler, <a href="https://projecteuler.net/problem=548">Problem 548: Gozinta Chains</a>. %Y A034776 Range of A002033, also odd elements form A000670. %K A034776 nonn %O A034776 1,2 %A A034776 _David W. Wilson_