|
%I #20 Sep 02 2021 08:19:16
%S 0,-2,-1,2,-4,-3,1,-3,-2,-2,0,1,4,-6,-5,3,-5,-4,-1,-1,0,3,-5,-4,2,-4,
%T -3,2,-4,-3,0,-2,-1,-1,-1,0,-4,2,3,6,-8,-7,5,-7,-6,-3,1,2,5,-7,-6,4,
%U -6,-5,1,-3,-2,1,-3,-2,0,-2,-1,-3,1,2,5,-7,-6,4,-6,-5
%N First of two variations by Per Nørgård of his "infinity sequence", cf. A004718: u(0) = 0; u(3*n) = -u(n); u(3*n+1) = u(n) - 2; u(3*n+2) = u(n) - 1.
%C Per Nørgård's surname is also written as Noergaard.
%C Not squarefree in contrast to A004718, first repetition of order 3: a(32) = a(33) = a(34) = -1, see link.
%H Reinhard Zumkeller, <a href="/A256184/b256184.txt">Table of n, a(n) for n = 0..10000</a>
%H Yu Hin (Gary) Au, Christopher Drexler-Lemire, and Jeffrey Shallit, <a href="https://doi.org/10.1080/17459737.2017.1299807">Notes and note pairs in Norgard's infinity series</a>, J. of Mathematics and Music (2017).
%H Christopher Drexler-Lemire and Jeffrey Shallit, <a href="http://arxiv.org/abs/1402.3091">Notes and Note-Pairs in Noergaard's Infinity Series</a>, arXiv:1402.3091 [math.CO], 2014, page 13.
%o (Haskell)
%o a256184 n = a256184_list !! n
%o a256184_list = 0 : concat (transpose [map (subtract 2) a256184_list,
%o map (subtract 1) a256184_list,
%o map negate $ tail a256184_list])
%o (Python)
%o from functools import lru_cache
%o @lru_cache(maxsize=None)
%o def a(n): return 0 if n == 0 else (a(n//3) - (3-n%3)) if n%3 else -a(n//3)
%o print([a(n) for n in range(72)]) # _Michael S. Branicky_, Sep 02 2021
%Y Cf. A004718, A256185, A087808, A085144, A255723.
%K sign
%O 0,2
%A _Reinhard Zumkeller_, Mar 19 2015
|
