[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A370634
A135507(n) is the product of the first n terms of this sequence.
2
1, 4, 5, 3, 3, 3, 9, 4, 3, 3, 13, 3, 3, 9, 3, 3, 19, 3, 3, 3, 9, 13, 25, 3, 3, 3, 3, 9, 31, 3, 3, 4, 13, 19, 9, 3, 39, 3, 3, 3, 43, 9, 3, 13, 3, 25, 49, 3, 3, 3, 19, 3, 55, 3, 3, 3, 3, 31, 61, 3, 3, 3, 3, 3, 3, 3, 69, 19, 3, 3, 73, 3, 3, 39, 3, 3, 3, 3, 81, 3
OFFSET
1,2
COMMENTS
Compactification of A135507 akin to A000705 with respect to A002201.
LINKS
Michael De Vlieger, Log log scatterplot of a(n), n = 1..2^20.
FORMULA
For n > 1, 3 <= a(n) <= n+2.
For p = A001359(i) such that gcd(a(p-1), p) = 1, a(p) = p+2 = A006512(i).
EXAMPLE
Table of first 20 terms of this sequence and S = A135507.
n S(n) a(n)
------------------------
1 1 1
2 4 4
3 20 5
4 60 3
5 180 3
6 540 3
7 4860 9
8 19440 4
9 58320 3
10 174960 3
11 2274480 13
12 6823440 3
13 20470320 3
14 184232880 9
15 552698640 3
16 1658095920 3
17 31503822480 19
18 94511467440 3
19 283534402320 3
20 850603206960 3
MATHEMATICA
nn = 120; j = 1; {1}~Join~Reap[Do[k = 2 j + LCM[j, i]; Sow[k/j]; j = k, {i, 2, nn}] ][[-1, 1]]
CROSSREFS
KEYWORD
nonn
AUTHOR
Michael De Vlieger, May 19 2024
STATUS
approved