Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #42 Aug 18 2018 21:38:25
%S 10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,
%T 10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,
%U 10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10
%N Constant sequence: a(n) = 10.
%C Also the representation of 2 in base 2 followed by 3 written in base 3, 4 in base 4, etc.
%H <a href="/index/Di#divseq">Index to divisibility sequences</a>
%H <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (1).
%F G.f.: 10/(1-x); e.g.f.: 10*e^x. - _Vincenzo Librandi_, Jan 29 2012
%t PadRight[{},100,10] (* _Harvey P. Dale_, Sep 03 2015 *)
%o (Maxima) makelist(10,n,0,30); /* _Martin Ettl_, Nov 09 2012 */
%o (PARI) a(n)=10 \\ _Charles R Greathouse IV_, Oct 07 2015
%K nonn,easy
%O 0,1
%A _N. J. A. Sloane_