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.
%I A227157 #37 Jan 24 2024 01:49:29
%S A227157 1,3,5,9,11,15,17,21,23,33,35,39,41,45,47,57,59,63,65,69,71,81,83,87,
%T A227157 89,93,95,105,107,111,113,117,119,153,155,159,161,165,167,177,179,183,
%U A227157 185,189,191,201,203,207,209,213,215,225,227,231,233,237,239,273
%N A227157 Numbers k whose factorial base representation A007623(k) does not contain any nonleading zeros.
%C A227157 a(A003422(n)) = A007489(n).
%C A227157 a(A007489(n)) = (n+1)!-1 thus A007489(n) gives the number of terms less than (n+1)! in this sequence.
%C A227157 Equivalently, there are n! terms in the sequence with their magnitude in range n!..(n+1)!.
%C A227157 Also numbers k such that A304036(k) = 1 for k > 0. - _Seiichi Manyama_, May 06 2018
%H A227157 Seiichi Manyama, <a href="/A227157/b227157.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..5913 from Antti Karttunen)
%t A227157 q[n_] := Module[{k = n, m = 2, c = 0, r}, While[{k, r} = QuotientRemainder[k, m]; k != 0 || r != 0, If[r == 0, c++]; m++]; c == 0]; Select[Range[300], q] (* _Amiram Eldar_, Jan 23 2024 *)
%o A227157 (Scheme, with _Antti Karttunen_'s IntSeq-library): (define A227157 (NONZERO-POS 1 1 A208575))
%Y A227157 The sequence gives all n for which A208575(n) is not zero. Complement of A227187. Subsets: A071156 (apart from zero), A231716, A231720.
%Y A227157 Cf. also A003422, A007489, A007623, A153880, A227130, A227132, A304036.
%K A227157 nonn,base
%O A227157 1,2
%A A227157 _Antti Karttunen_, Jul 04 2013