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 A265908 #10 Aug 16 2016 09:45:33 %S A265908 4,22,256,2500,24598,262192,3005356,36562174,478487968,12927533332, %T A265908 280630789030,5778343352464,118583043104764,2476606038823342, %U A265908 53484469903211776,1188931280602126420,27430026590262346558,653821165282804596712,16172901278558141600116,413537682797697142621894,10959122779052635897843288,300659352550430117464479652 %N A265908 a(n) = A255411(A265907(n)); also the first differences of A265907. %C A265908 In factorial base (A007623) these numbers are almost just like those of A265906, but shifted once left, with an extra zero appended, and then each nonzero digit incremented by one: %C A265908 20, 320, 20220, 324020, 4604320, 64004220, 824203020, <the first term with digit-value "10">, ... %H A265908 Antti Karttunen, <a href="/A265908/b265908.txt">Table of n, a(n) for n = 1..120</a> %H A265908 <a href="/index/Fa#facbase">Index entries for sequences related to factorial base representation</a> %F A265908 a(n) = A255411(A265907(n)) %F A265908 a(n) = A265907(n+1) - A265907(n). %o A265908 (Scheme, with two variants) %o A265908 (define (A265908 n) (A255411 (A265907 n))) %o A265908 (define (A265908 n) (- (A265907 (+ 1 n)) (A265907 n))) %Y A265908 Row 2 of A275960. %Y A265908 Cf. A007623, A255411. %Y A265908 First differences of A265907. %K A265908 nonn,base %O A265908 1,1 %A A265908 _Antti Karttunen_, Dec 20 2015