cp's OEIS Frontend

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.

%I A083796 #18 Sep 02 2024 01:20:40
%S A083796 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,
%T A083796 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,
%U A083796 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
%N 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.
%C A083796 See A101085 for more information.
%e A083796 The triangle begins:
%e A083796 1
%e A083796 2 1
%e A083796 1 2 3
%e A083796 1 2 5 6
%e A083796 1 2 3 4 14
%e A083796 1 2 3 4 8 30
%e A083796 1 2 3 4 5 6 39
%e A083796 1 2 3 4 5 6 11 28
%e A083796 1 2 3 4 5 6 7 8 804
%e A083796 1 2 3 4 5 6 7 8 24 1620
%e A083796 1 2 3 4 5 6 7 8 9 10 2465
%e A083796 1 2 3 4 5 6 7 8 9 10 17 15048
%o A083796 (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 */
%Y A083796 Cf. A083797, A083798, A083799, A101085.
%K A083796 nonn,tabl
%O A083796 1,2
%A A083796 _Amarnath Murthy_ and Meenakshi Srikanth (menakan_s(AT)yahoo.com), May 08 2003
%E A083796 Edited by _Gareth McCaughan_, Jun 10 2004