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.

A067117 a(n) = floor((concatenation of first n natural numbers)/ (n!)).

This page as a plain text file.
%I A067117 #17 Dec 21 2015 12:55:19
%S A067117 1,6,20,51,102,171,244,306,340,3402,30928,257737,1982597,14161414,
%T A067117 94409428,590058925,3470934853,19282971406,101489323191,507446615959,
%U A067117 2416412456951,10983692986143,47755186896276,198979945401152
%N A067117 a(n) = floor((concatenation of first n natural numbers)/ (n!)).
%H A067117 Harry J. Smith, <a href="/A067117/b067117.txt">Table of n, a(n) for n = 1..200</a>
%e A067117 a(5) = floor(123456/(6!)) = floor(123456/720) = 171.
%p A067117 x:= 0:
%p A067117 for n from 1 to 200 do
%p A067117   x:= x*10^(1+ilog10(n))+n;
%p A067117   A[n]:= floor(x/n!)
%p A067117 od:
%p A067117 seq(A[n],n=1..100); # _Robert Israel_, Dec 20 2015
%t A067117 Table[Floor[FromDigits[Flatten[IntegerDigits/@Range[n]]]/n!],{n,30}] (* _Harvey P. Dale_, Aug 27 2014 *)
%o A067117 (PARI) digitsIn(x)= { local(d); if (x==0, return(1)); d=1 + log(x)\log(10); if (10^d == x, d++, if (10^(d-1) > x, d--)); return(d) } Concat(a, b)= { return(a*10^digitsIn(b) + b) } { c=0; s=0; for (n=1, 200, c=Concat(c, n); s+=n; write("b067117.txt", n, " ", floor(c/n!)) ) } \\ _Harry J. Smith_, May 25 2010
%o A067117 (PARI) a007908(n) = my(s=""); for(k=1, n, s=Str(s, k)); eval(s);
%o A067117 a(n) = a007908(n) \ n!; \\ _Altug Alkan_, Dec 20 2015
%Y A067117 Cf. A007908, A067116.
%K A067117 easy,nonn,base
%O A067117 1,2
%A A067117 _Amarnath Murthy_, Jan 08 2002