Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #35 Jul 09 2021 17:43:35
%S 0,0,0,1,0,1,2,0,1,3,2,0,4,1,3,5,2,0,6,4,1,7,3,5,8,2,0,9,6,4,10,1,7,
%T 11,3,5,12,8,2,13,0,9,14,6,4,15,10,1,16,7,11,17,3,5,18,12,8,19,2,13,
%U 20,0,9,21,14,6,22,4,15,23,10,1,24,16,7,25
%N a(3n) = n, otherwise a(n) = a(floor(2n/3)).
%C This sequence is the unique fixed point of the function (a(0), a(1), a(2), ...) |--> (0, a(0), a(1), 1, a(2), a(3), 2, a(4), a(5), ...) which interleaves the nonnegative integers with pairs of elements of a sequence.
%C Compare with A025480, the unique fixed point of the function (a(0), a(1), a(2), ...) |--> (0, a(0), 1, a(1), 2, a(2), ...) which interleaves the nonnegative integers between the elements of a sequence.
%C These are the nim-values for heaps of n beans in the game where you're allowed to take up to one-third of the beans in a heap.
%H Michael De Vlieger, <a href="/A263390/b263390.txt">Table of n, a(n) for n = 0..10000</a>
%F a(n) = A163491(n+1) - 1. - _Peter Munn_, Nov 22 2020
%t Nest[Append[#1, If[Mod[#2, 3] == 0, #2/3, #1[[Floor[2 #2/3] + 1]]]] & @@ {#, Length[#]} &, {0}, 75] (* _Michael De Vlieger_, Jul 09 2021 *)
%o (PARI) a(n)=if(n%3,a(2*n\3),n/3) \\ _Charles R Greathouse IV_, Apr 30 2016
%Y Comparable sequences: A025480, A163491.
%Y Ordinal transform: A087088.
%K nonn,easy
%O 0,7
%A _Lee A. Newberg_, Apr 27 2016