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 A230429 #6 Oct 19 2013 11:00:46 %S A230429 1,2,5,10,17,23,46,70,92,119,238,358,476,597,719,1438,2158,2876,3597, %T A230429 4319,5039,10078,15118,20156,25197,30239,35279,40319,80638,120958, %U A230429 161276,201597,241919,282239,322558,362879,725758,1088638,1451516,1814397,2177279,2540159,2903038,3265912,3628799 %N A230429 Triangle T(n,k) giving the largest member of "the infinite trunk of factorial beanstalk" (A219666) whose factorial base representation contains n digits (A084558) and the most significant such digit (A099563) is k. %C A230429 See A007623 for the factorial number system representation. %e A230429 The first rows of this triangular table are: %e A230429 1; %e A230429 2, 5; %e A230429 10, 17, 23; %e A230429 46, 70, 92, 119; %e A230429 238, 358, 476, 597, 719; %e A230429 ... %e A230429 T(3,1) = 10 as 10 has factorial base representation 120, which is the largest such three digit term in A219666 beginning with factorial base digit 1 (in other words, for which A084558(x)=3 and A099563(x)=1). %e A230429 T(3,2) = 17 as 17 has factorial base representation 221, which is the largest such three digit term in A219666 beginning with factorial base digit 2. %e A230429 T(3,3) = 23 as 23 has factorial base representation 321, which is the largest such three digit term in A219666 beginning with factorial base digit 3. %o A230429 (Scheme) %o A230429 (define (A230429 n) (if (= (A002024 n) (A002260 n)) (- (A000142 (+ (A002024 n) 1)) 1) (A219651 (A230428 (+ 1 n))))) %Y A230429 Subset of A219666. Corresponding smallest terms: A230428. Can be used to compute A230420. Right edge: A033312. %K A230429 nonn,base,tabl %O A230429 1,2 %A A230429 _Antti Karttunen_, Oct 18 2013