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!)
A352967 Array read by antidiagonals: A(i, j) = abs(i - j) if min(i, j) < max(i, j) <= 2*min(i, j), and otherwise 0, with i >= 0 and j >= 0. 3
0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 2, 0, 2, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 2, 0, 2, 0, 0, 0, 0, 0, 0, 3, 1, 1, 3, 0, 0, 0, 0, 0, 0, 0, 2, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 3, 1, 1, 3, 0, 0, 0, 0, 0, 0, 0, 0, 4, 2, 0, 2, 4, 0, 0, 0, 0 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
0,24
LINKS
EXAMPLE
The array begins:
0, 0, 0, 0, 0, 0, 0, 0, ...
0, 0, 1, 0, 0, 0, 0, 0, ...
0, 1, 0, 1, 2, 0, 0, 0, ...
0, 0, 1, 0, 1, 2, 3, 0, ...
0, 0, 2, 1, 0, 1, 2, 3, ...
0, 0, 0, 2, 1, 0, 1, 2, ...
0, 0, 0, 3, 2, 1, 0, 1, ...
0, 0, 0, 0, 3, 2, 1, 0, ...
...
MATHEMATICA
A[i_, j_]:=If[Min[i, j]<Max[i, j]<=2Min[i, j], Abs[j-i], 0]; Flatten[Table[A[i-j, j], {i, 0, 12}, {j, 0, i}]]
CROSSREFS
Cf. A003983, A049581, A051125, A307018 (antidiagonal half-sums), A353452, A353453.
Sequence in context: A069845 A091397 A119818 * A331292 A331293 A335379
KEYWORD
nonn,tabl
AUTHOR
Stefano Spezia, Apr 21 2022
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 April 19 05:19 EDT 2024. Contains 371782 sequences. (Running on oeis4.)