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.

A036525 Smallest triangular number containing exactly n 8's.

This page as a plain text file.
%I A036525 #12 Mar 22 2020 17:30:39
%S A036525 28,3828,48828,828828,55888878,3288888856,78888885078,388884828828,
%T A036525 13889888887878,28888888883865,8980885988888880,88838888988888990,
%U A036525 983888888888812878,8838888986888887878,894885888888885888855,78888888822845888188878,1888886085781088888888878,18788848888888828885888126
%N A036525 Smallest triangular number containing exactly n 8's.
%t A036525 nsmall = Table[Infinity, 20];
%t A036525 For[i = 0, i <= 10^6, i++, p = PolygonalNumber[i];
%t A036525   n0 = Count[IntegerDigits[p], 8];
%t A036525   If[nsmall[[n0]] > p, nsmall[[n0]] = p]];
%t A036525 ReplaceAll[nsmall, Infinity -> "?"] (* _Robert Price_, Mar 22 2020 *)
%Y A036525 Cf. A048363, A036517-A036526.
%K A036525 nonn,base
%O A036525 1,1
%A A036525 _David W. Wilson_
%E A036525 a(13)-a(18) from _Giovanni Resta_, Oct 30 2019