A069829 a(n) = PS(n)(2n), where PS is described in A057032.

2, 5, 9, 11, 13, 19, 17, 23, 31, 26, 25, 40, 29, 47, 58, 51, 37, 69, 41, 56, 71, 67, 49, 82, 70, 73, 92, 95, 61, 123, 65, 105, 118, 94, 112, 148, 77, 107, 134, 116, 85, 143, 89, 122, 177, 127, 97, 166, 130, 133, 175, 162, 109, 211, 159, 188, 190, 154, 121, 248, 125

Offset: 1

Author

David Wasserman, Apr 22 2002

Keywords

• nonn
• look
• easy

Comments

a(n) = PS(n + c)(2n + c) for any positive integer c. Every positive integer occurs exactly once in either this sequence or in A057032.

Links

• Alois P. Heinz, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A057032.

Programs

Maple

A069829 := proc(n) local N, k; N := n;
for k from n by -1 to 1 do
    if irem(N, k) = 0 then
        if irem(N, k)::odd then
            N := N - k;
        else
            N := N + k;
        fi;
    fi;
od;
N end:
seq(A069829(n), n = 1..61); # Peter Luschny, Sep 14 2019