cp's OEIS Frontend

A181755 a(1) = 1, a(2) = 5. For n >= 3, a(n) is found by concatenating the first n-1 terms of the sequence and then dividing the resulting number by a(n-1).

%I A181755 #8 Aug 08 2014 15:15:29
%S A181755 1,5,3,51,301,51001,30100001,5100100000001,301000010000000000001,
%T A181755 5100100000001000000000000000000001,
%U A181755 3010000100000000000010000000000000000000000000000000001
%N A181755 a(1) = 1, a(2) = 5. For n >= 3, a(n) is found by concatenating the first n-1 terms of the sequence and then dividing the resulting number by a(n-1).
%C A181755 The calculations for the first few values of the sequence are
%C A181755 ... a(3) = 15/5 = 3
%C A181755 ... a(4) = 153/3 = 51
%C A181755 ... a(5) = 15351/51 = 301
%C A181755 ... a(6) = 15351301/301 = 51001.
%C A181755 For similarly defined sequences see A181754, A184756 and A181864 through A181870.
%F A181755 DEFINITION
%F A181755 a(1) = 1, a(2) = 5, and for n >= 3
%F A181755 (1)... a(n) = concatenate(a(1),a(2),...,a(n-1))/a(n-1).
%F A181755 RECURRENCE RELATION
%F A181755 For n >= 2
%F A181755 (2)... a(n+2) = 10^F(n)*a(n)+1,
%F A181755 where F(n) = A000045(n) are the Fibonacci numbers.
%F A181755 For n >= 2, a(n) has F(n-1) digits.
%p A181755 #A181755
%p A181755 M:=11:
%p A181755 a:=array(1..M):s:=array(1..M):
%p A181755 a[1]:=1:a[2]:=5:
%p A181755 s[1]:=convert(a[1],string):
%p A181755 s[2]:=cat(s[1],convert(a[2],string)):
%p A181755 for n from 3 to M do
%p A181755 a[n] := parse(s[n-1])/a[n-1];
%p A181755 s[n]:= cat(s[n-1],convert(a[n],string));
%p A181755 end do:
%p A181755 seq(a[n],n = 1..M);
%t A181755 nxt[lst_]:=Module[{nt=FromDigits[Flatten[IntegerDigits/@lst]]/Last[ lst]},Flatten[{lst,nt}]]; Nest[nxt[#]&,{1,5},10] (* _Harvey P. Dale_, Aug 08 2014 *)
%Y A181755 Cf. A000045, A181754, A181756, A181864, A181865, A181866, A181867, A181868, A181869, A181870
%K A181755 easy,nonn,base
%O A181755 1,2
%A A181755 _Peter Bala_, Nov 09 2010