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.

A143193 a(n) is the smallest natural number we cannot obtain from n, n+1, n+2, n+3, n+4, n+5, n+6, n+7, n+8 and the operators +, -, *, /, using each number only once.

This page as a plain text file.
%I A143193 #13 Oct 13 2013 17:47:26
%S A143193 7187,38103,54251,114358,168673,264111,319699,456061,588847,812092,
%T A143193 1005321,1222630,445059,499063,600907,706847,820609,929113,1048137,
%U A143193 1269847,1049291,1113439,1252843,1411942,1588841,456206,462382,464357,479894
%N A143193 a(n) is the smallest natural number we cannot obtain from n, n+1, n+2, n+3, n+4, n+5, n+6, n+7, n+8 and the operators +, -, *, /, using each number only once.
%C A143193 This sequence is related to the sequences A071110 (for 5 successive integers) and A060316 (for 6 successive integers).
%C A143193 What is the asymptotic value of this sequence? What is the first n for which a(n) equals the asymptotic value?
%H A143193 Gilles A. Fleury, <a href="/A143193/b143193.txt">Table of n, a(n) for n = 1..51</a>
%Y A143193 Cf. A071110, A060316, A071107, A060315, A141494, A142153.
%K A143193 nonn
%O A143193 1,1
%A A143193 _Gilles A.Fleury_, Oct 18 2008