login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A069829 a(n) = PS(n)(2n), where PS is described in A057032. 5
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

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

Table of n, a(n) for n=1..61.

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

CROSSREFS

Cf. A057032.

Sequence in context: A154732 A242936 A080154 * A022429 A020907 A206904

Adjacent sequences:  A069826 A069827 A069828 * A069830 A069831 A069832

KEYWORD

easy,nonn

AUTHOR

David Wasserman, Apr 22 2002

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 7 08:18 EST 2019. Contains 329841 sequences. (Running on oeis4.)