A083796 Triangle read by rows in which the n-th row contains n lexicographically earliest distinct numbers such that the sum of the (n-1) terms other than the r-th term is divisible by r.
1, 2, 1, 1, 2, 3, 1, 2, 5, 6, 1, 2, 3, 4, 14, 1, 2, 3, 4, 8, 30, 1, 2, 3, 4, 5, 6, 39, 1, 2, 3, 4, 5, 6, 11, 28, 1, 2, 3, 4, 5, 6, 7, 8, 804, 1, 2, 3, 4, 5, 6, 7, 8, 24, 1620, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 2465, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 17, 15048, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10
Offset: 1
Examples
The triangle begins: 1 2 1 1 2 3 1 2 5 6 1 2 3 4 14 1 2 3 4 8 30 1 2 3 4 5 6 39 1 2 3 4 5 6 11 28 1 2 3 4 5 6 7 8 804 1 2 3 4 5 6 7 8 24 1620 1 2 3 4 5 6 7 8 9 10 2465 1 2 3 4 5 6 7 8 9 10 17 15048
Programs
-
PARI
{ A083796row(n) = my(r,s,t,m); r=vector(n); s=Mod(0,1); for(i=1,n-1, m=gcd(s.mod,i); t=lift(s)%m; while( setsearch(Set(r),t) || (i==n-1 && Mod(sum(j=1,n-2,r[j])+t,n)), t+=m ); r[i]=t; s=chinese(s,Mod(t,i)); ); t=lift(s)-sum(j=1,n-1,r[j]); while( t<=0 || setsearch(Set(r),t), t+=s.mod ); r[n]=t; r; } /* Max Alekseyev, Nov 04 2015 */
Extensions
Edited by Gareth McCaughan, Jun 10 2004
Comments