Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Revision History for A161535

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

Showing all changes.
Array read by antidiagonals: Row n contains the positive multiples of the first n primes.
(history; published version)
#10 by Susanna Cuyler at Sun Feb 24 21:08:43 EST 2019
STATUS

proposed

approved

#9 by Jon E. Schoenfield at Sun Feb 24 20:28:12 EST 2019
STATUS

editing

proposed

#8 by Jon E. Schoenfield at Sun Feb 24 20:28:10 EST 2019
NAME

Array read by antidiagonals: Row n contains those the positive multiples of the first n primes.

EXAMPLE

Contribution from _From _R. J. Mathar_, Jul 04 2009: (Start)

. 2.. 4.. 6.. 8. 10. 12. 14. 16. 18. 20. 22. 24. 26. 28. 30. 32. 34. 36. 38. 40

. 2.. 3.. 4.. 6.. 8.. 9. 10. 12. 14. 15. 16. 18. 20. 21. 22. 24. 26. 27. 28. 30

. 2.. 3.. 4.. 5.. 6.. 8.. 9. 10. 12. 14. 15. 16. 18. 20. 21. 22. 24. 25. 26. 27

. 2.. 3.. 4.. 5.. 6.. 7.. 8.. 9. 10. 12. 14. 15. 16. 18. 20. 21. 22. 24. 25. 26

. 2.. 3.. 4.. 5.. 6.. 7.. 8.. 9. 10. 11. 12. 14. 15. 16. 18. 20. 21. 22. 24. 25

. 2.. 3.. 4.. 5.. 6.. 7.. 8.. 9. 10. 11. 12. 13. 14. 15. 16. 18. 20. 21. 22. 24

. 2.. 3.. 4.. 5.. 6.. 7.. 8.. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 20. 21. 22

. 2.. 3.. 4.. 5.. 6.. 7.. 8.. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 21

. 2.. 3.. 4.. 5.. 6.. 7.. 8.. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 21

. 2.. 3.. 4.. 5.. 6.. 7.. 8.. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 21

MAPLE

T := proc(n, k) option remember; local i, a; if k = 1 then 2; else for a from procname(n, k-1) +1 do for i from 1 to n do if a mod ithprime(i) =0 then RETURN(a); fi; od: od: fi; end: for d from 1 to 15 do for k from 1 to d do printf("%d, ", T(d-k+1, k)) ; od: od: [From _# _R. J. Mathar_, Jul 04 2009]

STATUS

approved

editing

#7 by Charles R Greathouse IV at Tue Mar 11 01:32:32 EDT 2014
AUTHOR

__Leroy Quet__, , Jun 13 2009

Discussion
Tue Mar 11
01:32
OEIS Server: https://oeis.org/edit/global/2122
#6 by N. J. A. Sloane at Wed Feb 05 20:18:57 EST 2014
AUTHOR

__Leroy Quet_, _, Jun 13 2009

Discussion
Wed Feb 05
20:18
OEIS Server: https://oeis.org/edit/global/2118
#5 by N. J. A. Sloane at Wed Feb 05 20:12:02 EST 2014
AUTHOR

_Leroy Quet, _, Jun 13 2009

Discussion
Wed Feb 05
20:12
OEIS Server: https://oeis.org/edit/global/2117
#4 by Russ Cox at Fri Mar 30 17:40:00 EDT 2012
EXAMPLE

Contribution from _R. J. Mathar (mathar(AT)strw.leidenuniv.nl), _, Jul 04 2009: (Start)

MAPLE

T := proc(n, k) option remember; local i, a; if k = 1 then 2; else for a from procname(n, k-1) +1 do for i from 1 to n do if a mod ithprime(i) =0 then RETURN(a); fi; od: od: fi; end: for d from 1 to 15 do for k from 1 to d do printf("%d, ", T(d-k+1, k)) ; od: od: [From _R. J. Mathar (mathar(AT)strw.leidenuniv.nl), _, Jul 04 2009]

EXTENSIONS

More terms from _R. J. Mathar (mathar(AT)strw.leidenuniv.nl), _, Jul 04 2009

Discussion
Fri Mar 30
17:40
OEIS Server: https://oeis.org/edit/global/190
#3 by N. J. A. Sloane at Sat Oct 02 03:00:00 EDT 2010
KEYWORD

nonn,tabl,new

AUTHOR

Leroy Quet (http://www.prism-of-spirals.net/), , Jun 13 2009

#2 by N. J. A. Sloane at Sun Jul 11 03:00:00 EDT 2010
KEYWORD

nonn,tabl,new

AUTHOR

Leroy Quet (q1qq2qqq3qqqq(AT)yahoohttp://www.prism-of-spirals.comnet/), Jun 13 2009

#1 by N. J. A. Sloane at Tue Jun 01 03:00:00 EDT 2010
NAME

Array read by antidiagonals: Row n contains those positive multiples of the first n primes.

DATA

2, 2, 4, 2, 3, 6, 2, 3, 4, 8, 2, 3, 4, 6, 10, 2, 3, 4, 5, 8, 12, 2, 3, 4, 5, 6, 9, 14, 2, 3, 4, 5, 6, 8, 10, 16, 2, 3, 4, 5, 6, 7, 9, 12, 18, 2, 3, 4, 5, 6, 7, 8, 10, 14, 20, 2, 3, 4, 5, 6, 7, 8, 9, 12, 15, 22, 2, 3, 4, 5, 6, 7, 8, 9, 10, 14, 16, 24, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 15, 18, 26, 2, 3, 4, 5

OFFSET

1,1

EXAMPLE

Row 2 consists of the positive multiples of the first 2 primes (2 and 3). 2,3,4,6,8,9,10,12,14,15,16,18,20,...

Contribution from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 04 2009: (Start)

The table starts

.2..4..6..8.10.12.14.16.18.20.22.24.26.28.30.32.34.36.38.40

.2..3..4..6..8..9.10.12.14.15.16.18.20.21.22.24.26.27.28.30

.2..3..4..5..6..8..9.10.12.14.15.16.18.20.21.22.24.25.26.27

.2..3..4..5..6..7..8..9.10.12.14.15.16.18.20.21.22.24.25.26

.2..3..4..5..6..7..8..9.10.11.12.14.15.16.18.20.21.22.24.25

.2..3..4..5..6..7..8..9.10.11.12.13.14.15.16.18.20.21.22.24

.2..3..4..5..6..7..8..9.10.11.12.13.14.15.16.17.18.20.21.22

.2..3..4..5..6..7..8..9.10.11.12.13.14.15.16.17.18.19.20.21

.2..3..4..5..6..7..8..9.10.11.12.13.14.15.16.17.18.19.20.21

.2..3..4..5..6..7..8..9.10.11.12.13.14.15.16.17.18.19.20.21

(End)

MAPLE

T := proc(n, k) option remember; local i, a; if k = 1 then 2; else for a from procname(n, k-1) +1 do for i from 1 to n do if a mod ithprime(i) =0 then RETURN(a); fi; od: od: fi; end: for d from 1 to 15 do for k from 1 to d do printf("%d, ", T(d-k+1, k)) ; od: od: [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 04 2009]

KEYWORD

nonn,tabl

AUTHOR

Leroy Quet (q1qq2qqq3qqqq(AT)yahoo.com), Jun 13 2009

EXTENSIONS

More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 04 2009

STATUS

approved