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

%I A125058
%S A125058 1,2,212,2122212,21222122122122212,
%T A125058 21222122122122212212221221222122122122212,
%U A125058 212221221221222122122212212221221221222122122212212212221221222122122122212212221221222122122122212
%N A125058 A sequence of words over an alphabet of two letters: a(0) = 1, a(1) = 
               2; a(n+2) = a(n+1)a(n)a(n+1).
%C A125058 A055642(a(n)) = A001333(n). - Reinhard Zumkeller, Feb 02 2007
%D A125058 Suggested by a posting by Igor G. Korepanov to "Jim's Forum", Jan 10 
               2007.
%F A125058 a(n)=(a(n-1)*A011557(A001333(n-2))+a(n-2))*A011557(A001333(n-2))+a(n-1). 
               - Reinhard Zumkeller, Feb 02 2007
%Y A125058 Sequence in context: A107612 A090560 A078280 this_sequence A101393 A124188 
               A078276
%Y A125058 Adjacent sequences: A125055 A125056 A125057 this_sequence A125059 A125060 
               A125061
%K A125058 nonn,base
%O A125058 0,2
%A A125058 N. J. A. Sloane (njas(AT)research.att.com), Jan 10 2007

Search completed in 0.001 seconds