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 A298980 #21 Oct 19 2019 04:12:27 %S A298980 3,6,7,8,10,14,17,20,22,26,28,30,33,36,37,40,41,42,50,57,58,59,60,62, %T A298980 63,64,66,67,69,70,71,72,73,74,76,77,78,79,80,81,82,83,84,85,86,87,88, %U A298980 89,90,91,92,93,94,95,96,97,98,100,114,118,122,126,130,134,141,148,158,161,164,167,170,173,176,184,187 %N A298980 Numbers n such that there exists an integer k < n for which the significant decimal digits of k/n (i.e., neglecting leading zeros) are those of n. %C A298980 Otherwise said, floor(10^m*k/n) = n for some k and m. %C A298980 Also, numbers n which have n as a subsequence in the decimal expansion of k/n, 0 < k < n. %C A298980 Initially it appears that if n is present so is 10n and 11n. These two statements are false. 14 is present but 140 is not. 1/140 = 0.00714285... 17 is present but 187 is not. %C A298980 However if there is a k between 0 and n so that gcd(k,n) = r > 1 and k/r is used to show that n/r is a term, then so is n. As an example, 33 is a term since 11/33 = 1/3 and 3 is a term. See the first example. %C A298980 The density of numbers in this sequence appears to increase to above 55% near n ~ 10^9. See A298981 for the complement and A298982 for the k-values. %e A298980 3 is a term since 1/3 = 0.3333... and its fractional part begins with 3; %e A298980 6 is a term since 10/6 = 1.666... and its fractional part begins with 6; %e A298980 7 is a term since 5/7 = 0.714285... and its fractional part begins with 7; %e A298980 8 is a term since 7/8 = 0.87500... and its fractional part begins with 8; %e A298980 10 is a term since 1/10 = 0.1000... and its fractional part begins with 10; %e A298980 14 is a term since 2/14 = 0.142857... and its fractional part begins with 14; %e A298980 17 is a term since 3/17 = 0.17647058823... and its fractional part begins with 17; etc. %t A298980 fQ = Compile[{{n, _Integer}}, Block[{k = 1, il = IntegerLength@ n}, While[m = 10^il*k/n; While[ IntegerLength@ Floor@ m < il, m *= 10]; k < n && Floor[m] != n, k++]; k < n]]; Select[Range@200, fQ] %o A298980 (PARI) is_A298980(n,k=(n^2-1)\10^(logint(n,10)+1)+1)={k*10^(logint((n^2-(n>1))\k,10)+1)\n==n} \\ Or use A298982 to get the k-value if n is in this sequence or 0 otherwise. \\ _M. F. Hasler_, Feb 01 2018 %Y A298980 Inspired by and equal to the range (= sorted terms) of A298232. %Y A298980 Complement of A298981. %Y A298980 Cf. A051626, A298982. %K A298980 easy,base,nonn %O A298980 1,1 %A A298980 _Eric Angelini_, _M. F. Hasler_ and _Robert G. Wilson v_, Jan 30 2018