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.

A294998 Numbers n such that the largest digit of n^3 is 8.

This page as a plain text file.
%I A294998 #11 Jul 03 2020 23:52:34
%S A294998 2,12,18,20,22,24,32,35,38,42,44,47,52,53,62,72,75,82,83,87,88,92,93,
%T A294998 94,95,96,102,104,114,115,120,122,123,127,138,141,142,145,152,153,155,
%U A294998 161,162,172,174,180,182,183,186,192,194,195,200,201,202,203,205,206,217,220,228,232,238,240,242,244,251
%N A294998 Numbers n such that the largest digit of n^3 is 8.
%C A294998 For any term a(n), all numbers of the form a(n)*10^k, k >= 0, are in this sequence. We could call "primitive" the terms not of this form, i.e., without trailing '0'.
%H A294998 Robert Israel, <a href="/A294998/b294998.txt">Table of n, a(n) for n = 1..10000</a>
%e A294998 12 is in the sequence because the largest digit of 12^3 = 1728 is 8.
%p A294998 filter:= n -> max(convert(n^3,base,10))=8:
%p A294998 select(filter, [$1..1000]); # _Robert Israel_, Jul 03 2020
%t A294998 Select[Range[300],Max[IntegerDigits[#^3]]==8&] (* _Harvey P. Dale_, Aug 21 2019 *)
%o A294998 (PARI) for(n=1,500, vecmax(digits(n^3))==8&&print1(n","))
%Y A294998 Cf. A295023 (the corresponding cubes); A278937, A294664, A294665, A294996 .. A294999 (same for digit 3, ..., 9); A295008 (same for squares).
%Y A294998 Cf. A000578 (the cubes).
%K A294998 nonn,base
%O A294998 1,1
%A A294998 _M. F. Hasler_, Nov 13 2017