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 A132068 #11 Oct 30 2019 16:51:47 %S A132068 1,1,1,1,1,2,1,1,1,1,1,4,1,1,1,1,1,1,1,2,2,2,1,1,2,1,2,1,1,2,4,2,1,1, %T A132068 1,1,1,1,1,1,1,1,1,4,2,4,1,1,1,1,1,1,1,1,1,1,1,1,1,2,2,4,2,2,1,1,2,3, %U A132068 1,3,2,1,1,2,2,2,2,2,2,2,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,4,2,4,2,4,1,1,1 %N A132068 Irregular array: row n has A000010(n) terms: the sum of the first m terms of row n is the m-th positive integer which is coprime to n. %C A132068 The first term of each row is 1. The sum of the terms of row n is n-1, for n>=2. After the initial 1, the remaining terms of each row are the same forward or backward. %e A132068 The positive integers which are <= 12 and are coprime to 12 are 1,5,7,11. Row 12 of the array is: 1,4,2,4. So we have: 1=1; 1+4=5; 1+4+2=7; 1+4+2+4=11. %e A132068 The first 12 rows of the array: %e A132068 1; %e A132068 1; %e A132068 1,1; %e A132068 1,2; %e A132068 1,1,1,1; %e A132068 1,4; %e A132068 1,1,1,1,1,1; %e A132068 1,2,2,2; %e A132068 1,1,2,1,2,1; %e A132068 1,2,4,2; %e A132068 1,1,1,1,1,1,1,1,1,1; %e A132068 1,4,2,4 %t A132068 f[n_] := Block[{g},g = Select[Range[n], GCD[ #, n] == 1 &]; g - Prepend[Most[g], 0]]; Flatten[Array[f, 25]] (* _Ray Chandler_, Nov 01 2007 *) %Y A132068 Cf. A038566, A000010. %K A132068 nonn,tabf %O A132068 1,6 %A A132068 _Leroy Quet_, Oct 30 2007 %E A132068 Extended by _Ray Chandler_, Nov 01 2007