|
|
|
|
3, 5, -1, 1, 11, 13, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, 35, 37, -1, 1, -1, -45, 1, -1, 1, -1, 1, -1, 1, -1, 1, 65, 67, -1, 1, -1, -75, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, 131, 133, -1, 1, -1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
LINKS
|
|
|
PROG
|
(PARI) vR(nn) = my(s, t, v=vector(nn)); for(n=1, nn, s=bitor(s, 1<<t += if( t<=n || bittest(s, t-n), n, -n)); v[n]=t); concat(0, v); \\ from A005132
lista(nn) = my(v=vR(nn+1)); vector(nn, k, v[k+2] - v[k]); \\ Michel Marcus, Aug 14 2022
(Python)
from itertools import count, islice
def A356551_gen(): # generator of terms
b, c, aset = 0, 1, {0}
for n in count(2):
aset.add(c)
a, b, c = b, c, d if (d:=c-n)>=0 and d not in aset else c+n
yield c-a
|
|
CROSSREFS
|
|
|
KEYWORD
|
sign
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|