cp's OEIS Frontend

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.

A096090 Index of the first occurrence of n in A096089, or 0 if n never appears.

This page as a plain text file.
%I A096090 #8 Jul 26 2015 11:29:47
%S A096090 1,13,15,17,116,117,119,1119,0,10,506,304,203,508,305,509,102,1012,
%T A096090 307,205,308,2035,103,1033,2056,207,1013,2067,104,1044,209,1034,1024,
%U A096090 105,1055,1014,1045,106,1035,2029,107,10225,1046,1015,108,1036,109,1078
%N A096090 Index of the first occurrence of n in A096089, or 0 if n never appears.
%C A096090 a(9) = 0. For any number with any 0 digits, A096089(n) >= 10. The only number with n digits and no zeros that can be multiplied by 9 to produce a number with the same number of digits is 111...1, so 9 cannot be achieved. A similar argument shows that a(n) = 0 for any n whose leading digit is 9. Note that a(89) = 1011199; probably every number whose leading digit is not 9 does occur in A096089. - _Franklin T. Adams-Watters_, Jul 19 2006
%H A096090 R. J. Mathar, <a href="/A096090/a096090_1.txt">List of n, a(n)</a> for n=1..1000 with a(n)=-1 for unknown terms.
%e A096090 a(7) = 119 as floor[911/119] = floor[7.655462184...] = 7 and 119 is the smallest such number.
%Y A096090 Cf. A096089, A096091.
%K A096090 base,nonn
%O A096090 1,2
%A A096090 _Amarnath Murthy_, Jun 22 2004
%E A096090 1119 from Sam Handler (sam_5_5_5_0(AT)yahoo.com), Jul 19 2004, who remarks that a(9) is not known. The terms after a(9) are 10, 506, 304, 203, 508, 305, 509, 102, 1012, 307, 205, 308, 2035, 103, 1033, 2056, 207, 1013, 2067, 104, 1044, 209, 1034, 1024, 105, 1055, 1014, 1045, 106, 1035, 2029, 107, ...
%E A096090 More terms from _Franklin T. Adams-Watters_, Jul 19 2006