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 A003590 #36 Jun 03 2025 01:14:35
%S A003590 1,11,121,1331,14641,15101051,1615201561,172135352171,18285670562881,
%T A003590 193684126126843691,1104512021025221012045101,
%U A003590 1115516533046246233016555111,1126622049579292479249522066121,11378286715128717161716128771528678131
%N A003590 Rows of Pascal's triangle written as a single number.
%C A003590 If n<=500, a(n) is prime only for a(1)=11, a(8)=18285670562881, and a(29). - _Enrique Pérez Herrero_, Jun 05 2010
%D A003590 Alfred S. Posamentier, Math Charmers, Tantalizing Tidbits for the Mind, Prometheus Books, NY, 2003, page 273.
%H A003590 Harvey P. Dale, <a href="/A003590/b003590.txt">Table of n, a(n) for n = 0..68</a>
%F A003590 a(n) mod 100 = 1 + 10 * (n mod 10). - _Enrique Pérez Herrero_, May 27 2010
%p A003590 a:= n-> parse(cat(seq(binomial(n,k), k=0..n))):
%p A003590 seq(a(n), n=0..15); # _Alois P. Heinz_, Jan 15 2024
%t A003590 A003590[i_Integer] := ToExpression[StringJoin[Table[ToString[Binomial[i, j]], {j, 0, i}]]] (* _Enrique Pérez Herrero_, May 27 2010 *)
%t A003590 FromDigits[Flatten[IntegerDigits/@#]]&/@Table[Binomial[i,j],{i,0,15},{j,0,i}] (* _Harvey P. Dale_, Aug 11 2024 *)
%o A003590 (PARI) A003590(i)={ my(j,a); a=""; for(j=0,i,a=Str(a,binomial(i,j)) ); return(eval(a)); } /* _Enrique Pérez Herrero_, Jun 03 2010 */
%Y A003590 Cf. A007318.
%K A003590 nonn,easy,base
%O A003590 0,2
%A A003590 Matthew Wells (mwells(AT)nmt.edu)
%E A003590 Offset 0 from _Alois P. Heinz_, Jan 15 2024