Search: id:A053838
Results 1-1 of 1 results found.

%I A053838
%S A053838 0,1,2,1,2,0,2,0,1,1,2,0,2,0,1,0,1,2,2,0,1,0,1,2,1,2,0,1,2,0,2,0,1,0,1,
%T A053838 2,2,0,1,0,1,2,1,2,0,0,1,2,1,2,0,2,0,1,2,0,1,0,1,2,1,2,0,0,1,2,1,2,0,2,
%U A053838 0,1,1,2,0,2,0,1,0,1,2,1,2,0,2,0,1,0,1,2,2,0,1,0,1,2,1,2,0,0,1,2,1,2,0
%N A053838 (Sum of digits of n written in base 3) modulo 3.
%C A053838 Equals A004128, (0, 1, 2, 4, 5, 6, 8, 9, 10,...) mod 3 [From Gary W. 
               Adamson (qntmpkt(AT)yahoo.com), Aug 24 2008]
%H A053838 Michael Gilleland, <a href="selfsimilar.html">Some Self-Similar Integer 
               Sequences</a>
%F A053838 a(n) =A010872(A053735(n)) =(n+a(floor[n/3])) mod 3. So can construct 
               sequence by starting with 0 and mapping 0->012, 1->120 and 2->201 
               (e.g. 0, 012, 012120201, 012120201120201012201012120, ...) and looking 
               at n-th digit of a term with sufficient digits.
%t A053838 Nest[ Flatten[ # /. {0 -> {0, 1, 2}, 1 -> {1, 2, 0}, 2 -> {2, 0, 1}}] 
               &, {0}, 7] (from Robert G. Wilson v Mar 08 2005).
%Y A053838 Cf. A010060, A053837, A053839-A053844.
%Y A053838 Equals A026600(n+1) - 1.
%Y A053838 A004128 [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Aug 24 2008]
%Y A053838 Sequence in context: A166453 A118233 A159955 this_sequence A117167 A117169 
               A046920
%Y A053838 Adjacent sequences: A053835 A053836 A053837 this_sequence A053839 A053840 
               A053841
%K A053838 base,nonn
%O A053838 0,3
%A A053838 Henry Bottomley (se16(AT)btinternet.com), Mar 28 2000

Search completed in 0.001 seconds