OFFSET
1,1
COMMENTS
The actual array that leads to the list given above is:
2 3 5 7 11 13 17 19 ...
1 7 23 59 119 191 287 395 ...
1 131 1275 6843 22419 54339 112683 241915 ...
1 165619 8716707 ...
1 1443643414307 ...
It can be observed that:
1) Obviously, all primes will appear in the list at least once, as the first row of the generating array is composed of all the primes.
2) There exist primes that appear more than once (e.g., 23, 59, 131, 191...).
3) When we have two successive primes in a row, prime(i) & prime(i+1) -as in all of the first row, and occasionally in other rows- the element just below these two is, obviously, Euler_tot( prime(i) * prime (i+1) ) - 1.
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
Umut Uludag, Sep 17 2009
STATUS
approved