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 A058190 #7 Nov 20 2017 23:42:38
%S A058190 0,0,0,1,0,0,0,2,2,0,0,1,0,0,0,5,0,2,0,1,0,0,0,2,4,0,4,1,0,0,0,6,0,0,
%T A058190 0,5,0,0,0,2,0,0,0,1,2,0,0,5,6,4,0,1,0,4,0,2,0,0,0,1,0,0,2,13,0,0,0,1,
%U A058190 0,0,0,6,0,0,4,1,0,0,0,5,12,0,0,1,0,0,0,2,0,2,0,1,0,0,0,6,0,6,2,9,0,0,0
%N A058190 Number of increasing geometric progressions ending in n (in the positive integers), excluding those of length 1 or 2.
%H A058190 Antti Karttunen, <a href="/A058190/b058190.txt">Table of n, a(n) for n = 1..16384</a>
%F A058190 a(n) = A058189(n) - n.
%e A058190 a(16) = 5 since the possibilities are (1,4,16), (1,2,4,8,16), (2,4,8,16), (4,8,16), (9,12,16).
%o A058190 (PARI)
%o A058190 ends_max_progression_of_length(n,ratio) = { my(k=1); while(1,if(denominator(n)>1,return(k)); n *= ratio; k++;) };
%o A058190 A058190(n) = sum(d=1,(n-1),max(0,ends_max_progression_of_length(d,d/n)-2)); \\ _Antti Karttunen_, Nov 19 2017
%Y A058190 Cf. A058189.
%K A058190 nonn
%O A058190 1,8
%A A058190 _Henry Bottomley_, Nov 22 2000