login

Revision History for A182630

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
T(n,k) = A002024(k+1)*n + A002262(k), n >= 0, k >= 0, read by antidiagonals.
(history; published version)
#21 by Joerg Arndt at Sun May 12 02:18:33 EDT 2019
STATUS

reviewed

approved

#20 by Michel Marcus at Sun May 12 01:32:46 EDT 2019
STATUS

proposed

reviewed

#19 by Jon E. Schoenfield at Sat May 11 23:58:33 EDT 2019
STATUS

editing

proposed

Discussion
Sat May 11
23:59
Jon E. Schoenfield: (as viewed by clicking on the "#19" link, of course...)  :-)
Sun May 12
01:32
Michel Marcus: neat
#18 by Jon E. Schoenfield at Sat May 11 23:57:42 EDT 2019
NAME

T(n,k) = A002024(k+1)*n + A002262(k), n >= 0, k >= 0, read by antidiagonals.

EXAMPLE

A Table of Congruences.congruences:

=======================================================->

===============+====+=======+==========+=============+====

Mod ----------> /. mod | 1 ./.. | 2 ../... | 3 .../..... | 4 .. | .../->

=======================================================->

===============+====+=======+==========+=============+====

Congruent congruent to --> ..| 0. .. | 0.. 1. .. | 0.. 1.. 2. .. | 0.. 1.. 2.. 3 | ... ->

=======================================================->

===============+====+=======+==========+=============+====

Array begins: | 0 | 0 1 | 0 1 2 | 0 1 2 3 | ...

................ ..0. ..0..1. ..0..1..2. ..0..1..2..3. ->

................ .. | 1. .. | 2.. 3. .. | 3.. 4.. 5. .. | 4.. 5.. 6.. 7 | ... ->

................ .. | 2. .. | 4.. 5. .. | 6.. 7.. 8. .. | 8.. 9. 10. 11 | ... ->

................ .. | 3. .. | 6.. 7. .. | 9. 10. 11. . | 12. 13. 14. 15 | ... ->

................ .. | 4. .. | 8.. 9. . | 12. 13. 14. . | 16. 17. 18. 19 | ... ->

................ .. | 5. . | 10. 11. . | 15. 16. 17. . | 20. 21. 22. 23 | ... ->

................ .. | 6. . | 12. 13. . | 18. 19. 20. . | 24. 25. 26. 27 | ... ->

................ .. | 7. . | 14. 15. . | 21. 22. 23. . | 28. 29. 30. 31 | ... ->

................ .. | 8. . | 16. 17. . | 24. 25. 26. . | 32. 33. 34. 35 | ... ->

................ .. | 9. . | 18. 19. . | 27. 28. 29. . | 36. 37. 38. 39 | ... ->

................ . | 10. . | 20. 21. . | 30. 31. 32. . | 40. 41. 42. 43 | ... ->

MAPLE

A182630 := proc(n, k) A002024(k+1)*n+A002262(k) ; end proc: # _R. J. Mathar, _, Dec 09 2010

STATUS

approved

editing

Discussion
Sat May 11
23:58
Jon E. Schoenfield: Table reformatted in an effort to make it more readable.  Is this okay?
#17 by Russ Cox at Fri Mar 30 17:34:04 EDT 2012
AUTHOR

_Omar E. Pol (info(AT)polprimos.com), _, Dec 06 2010

Discussion
Fri Mar 30
17:34
OEIS Server: https://oeis.org/edit/global/157
#16 by R. J. Mathar at Sun Dec 12 14:04:02 EST 2010
STATUS

reviewed

approved

#15 by Klaus Brockhaus at Sat Dec 11 06:24:12 EST 2010
STATUS

proposed

reviewed

Discussion
Sun Dec 12
03:28
Omar E. Pol: I agree.
#14 by Klaus Brockhaus at Sat Dec 11 06:23:41 EST 2010
NAME

A table of congruences. T(n,k) = A002024(k+1)*n+A002262(k), n>=0, k>=0, read by antidiagonals.

COMMENTS

This array read by antidiagonals is also a polyhelix. It is also a polyzigzag in a triangular prism. It is also a tetrahedron. Rows and columns are infinite. (explanation to be continued)

A table of congruences.

#13 by Klaus Brockhaus at Thu Dec 09 18:19:33 EST 2010
COMMENTS

This array read by antidiagonals is also a polyhelix. It is also a polyzigzag in a triangular prism. It is also and also a tetrahedron. Rows and columns have are infinite terms . (explanation to be continued).

EXAMPLE

And so on.

CROSSREFS
STATUS

approved

proposed

Discussion
Sat Dec 11
05:30
Joerg Arndt: I would think that a comment ending in "explanation to be continued" is not acceptable. Suggest to remove it, later the complete version of the comment can easily be added.
06:22
Klaus Brockhaus: Omar, please don't add unfinished comments. I'll delete this one.
#12 by N. J. A. Sloane at Thu Dec 09 16:33:51 EST 2010
STATUS

proposed

approved