Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #20 Jun 28 2023 08:38:34
%S 1,0,8,68,88,688,888,6888,8888,68888,88888,688888,888888,6888888,
%T 8888888,68888888,88888888,688888888,888888888,6888888888,8888888888,
%U 68888888888,88888888888,688888888888,888888888888,6888888888888,8888888888888,68888888888888
%N Least nonnegative integer whose decimal digits divide the plane into n regions (A250257 variant).
%C Equivalently, with offset 0, least nonnegative integer with n holes in its decimal digits. Leading zeros are not permitted. Variation of A250257 with the numeral "4" considered open at the top, as it is often handwritten. See also the comments in A249572.
%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (1, 10, -10).
%F a(n) = 10*a(n-2) + 8 for n >= 5.
%F a(n) = A250256(n), n<>2.
%F From _Chai Wah Wu_, Jul 12 2016: (Start)
%F a(n) = a(n-1) + 10*a(n-2) - 10*a(n-3) for n > 5.
%F G.f.: x*(-60*x^4 + 70*x^3 - 2*x^2 - x + 1)/((x - 1)*(10*x^2 - 1)). (End)
%e The integer 68, whose decimal digits have 3 holes, divides the plane into 4 regions. No smaller nonnegative integer does this, so a(4) = 68.
%t Join[{1, 0, 8}, RecurrenceTable[{a[1]==68, a[2]==88, a[n]==10 a[n-2] + 8}, a, {n, 20}]] (* _Vincenzo Librandi_, Nov 16 2014 *)
%o (Magma) I:=[1,0,8,68,88]; [n le 5 select I[n] else 10*Self(n-2)+8: n in [1..40]]; // _Vincenzo Librandi_, Nov 16 2014
%Y Cf. A249572, A250256, A250257, A001743, A001744, A001745, A001746, A002282.
%K nonn,base,easy
%O 1,3
%A _Rick L. Shepherd_, Nov 15 2014