login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A082219 In the square array shown below, numbers (not occurring earlier) are entered like this a(1, 1), a(1, 2), a(2, 1), a(3, 1), a(2, 2), a(1, 3), a(1, 4), a(2, 3), a(3, 2), a(4, 1), a(5, 1), a(4, 2), ... in such a way that every n-th partial sum of a row or a column is a multiple of n. Sequence contains the first row. 6
1, 3, 2, 10, 19, 25, 24, 28, 41, 27, 51, 81, 78, 86, 124, 120, 147, 123, 188, 142, 192, 116, 258, 250, 314, 254, 320, 392, 470, 404, 453, 377, 490, 612, 533, 445, 718, 708, 812, 602, 784, 726, 791, 771, 928, 1002, 1032, 1158, 996, 972, 1149, 1023, 1365, 1239 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..54.

EXAMPLE

1 3 2 10 19 25...

5 7 12 16 15...

6 8 13 37...

4 14 18...

9 23...

11...

...

PROG

PARI code from Max Alekseyev:

{ A082219() =

a=matrix(1000, 1000);

S=Set();

for(s=2, 1001, if(s%2, i0=1; i1=s-1; i2=1, i0=s-1; i1=1; i2=-1); forstep(i=i0, i1, i2, j=s-i;

ii=sum(k=1, j-1, a[i, k]); jj=sum(k=1, i-1, a[k, j]);

c=chinese(Mod(ii, j), Mod(jj, i));

t=component(c, 1)-lift(c); while(setsearch(S, t), t+=component(c, 1));

a[i, j]=t;

S=setunion(S, [t]);

if(i==1, print1(", ", sum(k=1, j, a[i, j])/j) );

))

}

CROSSREFS

Cf. A082218, A082220, A082221, A082222, A082223.

Sequence in context: A011953 A038519 A192617 * A034461 A070033 A107334

Adjacent sequences:  A082216 A082217 A082218 * A082220 A082221 A082222

KEYWORD

nonn

AUTHOR

Amarnath Murthy and Meenakshi Srikanth (menakan_s(AT)yahoo.com), Apr 09 2003

EXTENSIONS

More terms from Max Alekseyev, Jun 08 2007

Edited by N. J. A. Sloane, Jun 11 2007

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 24 06:53 EDT 2019. Contains 323529 sequences. (Running on oeis4.)