OFFSET
0,3
LINKS
Antti Karttunen, Table of n, a(n) for n = 0..1023
FORMULA
Conjecture: for n > 1, floor(log_2(a(n))) = 2*n - (1,2,1,4,1,2,1,5 according as n == 0..7 (mod 8), respectively). - Alan Michael Gómez Calderón, Mar 02 2023
PROG
(PARI)
\\ Use this one for writing b-files:
A327972write(up_to) = { my(s1=1, s2=1); for(n=0, up_to, write("b327972.txt", n, " ", bitxor(s1, s2)); s1 = A048727(s1); s2 = A269160(s2)); };
(Python)
def A048727(n): return(n^(n<<1)^(n<<2))
def A269160(n): return(n^((n<<1)|(n<<2)))
def genA327972():
'''Yield successive terms of A327972.'''
s1 = 1
s2 = 1
while True:
yield (s1^s2)
s1 = A269160(s1)
s2 = A048727(s2)
CROSSREFS
KEYWORD
nonn
AUTHOR
Antti Karttunen, Oct 03 2019
STATUS
approved