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!)
A082019 Diagonal of square array T(n,k) with T(1,1) = 1 where antidiagonals are filled alternating upwards and downwards with the smallest number not already used such that the n-th antidiagonal sum is a multiple of n. 3

%I #7 Dec 05 2013 19:56:04

%S 1,5,12,25,41,60,85,112,145,180,221,264,313,365,420,481,544,613,684,

%T 761,840,925,1012,1105,1200,1301,1404,1513,1624,1741,1860,1985,2112,

%U 2245,2380,2521,2664,2813,2964,3121,3281,3444,3613,3784,3961,4140,4325,4512

%N Diagonal of square array T(n,k) with T(1,1) = 1 where antidiagonals are filled alternating upwards and downwards with the smallest number not already used such that the n-th antidiagonal sum is a multiple of n.

%e T(n,k) begins:

%e 1, 2, 7, 6, 18, 15, ...

%e 4, 5, 8, 14, 16, 27, ...

%e 3, 9, 12, 17, 26, 31, ...

%e 13, 11, 19, 25, 32, 42, ...

%e 10, 20, 24, 33, 41, 50, ...

%e 21, 23, 34, 39, 51, 60, ...

%Y Cf. A074135, A082017, A082018, A082002, A082003, A082004, A082005.

%K nonn

%O 1,2

%A _Amarnath Murthy_, Apr 05 2003

%E Edited and more terms from _Alois P. Heinz_, Oct 26 2011

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 August 18 02:03 EDT 2024. Contains 375255 sequences. (Running on oeis4.)