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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A082018 First column 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
1, 4, 3, 13, 10, 21, 22, 40, 36, 64, 55, 81, 78, 115, 105, 138, 136, 182, 171, 211, 210, 265, 253, 300, 301, 364, 351, 433, 406, 477, 465, 556, 528, 606, 595, 695, 666, 751, 741, 850, 820, 912, 903, 1021, 990, 1089, 1081, 1208, 1176, 1282, 1275, 1411, 1378 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

This is the boustrophedon method of filling an array. Sums of antidiagonals of T are in A074132. Sums of antidiagonals of T divided by number of antidiagonals are in A074133. Diagonal of T is in A082019.

EXAMPLE

T(n,k) begins:

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

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

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

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

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

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

CROSSREFS

Cf. A074135, A082017, A082019, A082020, A082002, A082003, A082004, A082005.

Sequence in context: A178756 A169706 A120340 * A056477 A105200 A088933

Adjacent sequences:  A082015 A082016 A082017 * A082019 A082020 A082021

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 05 2003

EXTENSIONS

Edited and more terms from Alois P. Heinz (heinz(AT)hs-heilbronn.de), Oct 26 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 18:47 EST 2012. Contains 205663 sequences.