login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 7
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 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
See A101085 for more information.
LINKS
EXAMPLE
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
PROG
(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 */
CROSSREFS
Sequence in context: A070990 A097868 A025830 * A037039 A333856 A182972
KEYWORD
nonn,tabl
AUTHOR
Amarnath Murthy and Meenakshi Srikanth (menakan_s(AT)yahoo.com), May 08 2003
EXTENSIONS
Edited by Gareth McCaughan (gareth.mccaughan(AT)pobox.com), Jun 10 2004
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 05:39 EDT 2024. Contains 371235 sequences. (Running on oeis4.)