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.

A077341 Triangle in which n-th row contains the first n numbers, not already present, that begin with n.

This page as a plain text file.
%I A077341 #17 Mar 14 2015 00:27:23
%S A077341 1,2,20,3,30,31,4,40,41,42,5,50,51,52,53,6,60,61,62,63,64,7,70,71,72,
%T A077341 73,74,75,8,80,81,82,83,84,85,86,9,90,91,92,93,94,95,96,97,10,100,101,
%U A077341 102,103,104,105,106,107,108,11,110,111,112,113,114,115,116,117,118,119,12
%N A077341 Triangle in which n-th row contains the first n numbers, not already present, that begin with n.
%C A077341 Every positive number appears exactly once. Proof: N will appear as the first term of row N, unless it has already appeared. And no term is repeated, by definition.
%C A077341 The first term of the 20th row is 200 unlike the 20th row of A077339 where it is 20.
%H A077341 M. F. Hasler, <a href="/A077341/b077341.txt">Table of n, a(n) for n = 1..5350</a>
%e A077341 Triangle begins:
%e A077341 1
%e A077341 2 20
%e A077341 3 30 31
%e A077341 4 40 41 42
%e A077341 5 50 51 52 53
%e A077341 ...
%o A077341 (PARI) {u=[];for(m=1,19,o=0;for(n=1,m,while(setsearch(u,a=A077339(m,n+o)),o++);u=setunion(u,Set(a));print1(a",")))} \\ _M. F. Hasler_, Jan 08 2013
%Y A077341 Cf. A077339, A077340 (see there for differences), A077342, A077343.
%K A077341 base,easy,nonn,tabl
%O A077341 1,2
%A A077341 _Amarnath Murthy_, Nov 05 2002
%E A077341 Edited by _N. J. A. Sloane_, Jun 12 2007