login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A065197 Solutions to A065191(n) = n. 7
1, 5, 90, 117, 154, 446, 3650, 4754, 8110, 69977, 74014, 401477, 432257, 545185 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
MATHEMATICA
Reap[Do[pos = n; Do[pos -= k (-1)^Quotient[pos, k], {k, n, 1, -1}]; pos -= If[Mod[n, 4] < 2, 1, -1]; If[pos == n, Print[n]; Sow[n]], {n, 1, 10^4} ]][[2, 1]] (* Jean-François Alcover, Mar 02 2020, after Charlie Neder in A065191 *)
PROG
(Python)
from itertools import islice, count
def A065197gen(): # generator of terms, after Charlie Neder in A065191
for n in count(1):
m = n
for k in range(n, 1, -1):
m += k if (m//k) % 2 else -k
if m == n:
yield n
A065197_list = list(islice(A065197(), 10)) # Chai Wah Wu, Dec 15 2021
CROSSREFS
Sequence in context: A067258 A167424 A174591 * A300348 A336783 A300433
KEYWORD
nice,nonn,more
AUTHOR
Klaus Strassburger (strass(AT)ddfi.uni-duesseldorf.de), Oct 19 2001
EXTENSIONS
a(7)-a(9) from Charlie Neder, Feb 04 2019
a(10)-a(14) from Chai Wah Wu, Dec 15 2021
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 23:26 EDT 2024. Contains 371917 sequences. (Running on oeis4.)