Max Alekseyev, <a href="/A122711/b122711_2.txt">Table of n, a(n) for n = 1..110</a> (all terms below 10^15)
Max Alekseyev, <a href="/A122711/b122711_2.txt">Table of n, a(n) for n = 1..110</a> (all terms below 10^15)
editing
approved
Max Alekseyev, <a href="/A122711/b122711_2.txt">Table of n, a(n) for n = 1..110</a> (all terms below 10^15)
b-file corrected by Max Alekseyev, Oct 03 11 2016
Max Alekseyev, <a href="/A122711/b122711_2.txt">Table of n, a(n) for n = 1..109110</a> (all terms below 10^15)
approved
editing
editing
approved
Also, the positive numbers A015922(k)-2 that are multiples of 4. E.g., a(1) = 106976 = A015922(3926)-2. Hence, a(n)+2 forms a subsequence of A015922 (and of A130134) consisting of the terms congruent to 2 modulo 4. - Max Alekseyev, Apr 03 2014
More terms from Max Alekseyev (Sep 23 2006, Oct 01 2006). He has found several other members of this sequence: 45270492952372075535792, 999921104540627677377360, but these may not be the next terms.
More terms from Max Alekseyev, Sep 23 2006, Oct 01 2006
approved
editing
Max Alekseyev, <a href="/A122711/b122711_1.txt">Table of n, a(n) for n = 1..109</a> (all terms below 10^15)
editing
approved
Max Alekseyev, <a href="/A122711/b122711_1.txt">Table of n, a(n) for n = 1..109</a> (all terms below 10^15)
b-file corrected by Max Alekseyev, Oct 03 2016
Max Alekseyev, <a href="/A122711/b122711_1.txt">Table of n, a(n) for n = 1..108109</a> (contains all terms below 10^15)
approved
editing