login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A248131 Start with a(0) = 1, then a(n) = three times the n-th digit of the sequence. 3

%I #14 Oct 02 2014 22:51:48

%S 1,3,9,27,6,21,18,6,3,3,24,18,9,9,6,12,3,24,27,27,18,3,6,9,6,12,6,21,

%T 6,21,3,24,9,18,27,18,3,6,18,6,3,18,6,3,9,6,12,27,3,24,6,21,3,24,9,18,

%U 3,24,18,9,3,24,18,9,27,18,3,6,6,21,9,6,12,18,6,3,9,6,12,27

%N Start with a(0) = 1, then a(n) = three times the n-th digit of the sequence.

%C A (more natural?) variant of A248128, using the same rule but the smallest nontrivial initial value a(0)=1 instead of 50. However, none of the digits 0 and 5 can appear in the sequence if they don't appear in a(0), which motivates A248128(0)=50. See A248153 for a variant using multiples of 7 instead of 3.

%C All terms a(n) with index n>0 are divisible by 3, the sequence a(n)/3 yields exactly the individual digits of this sequence.

%H Reinhard Zumkeller, <a href="/A248131/b248131.txt">Table of n, a(n) for n = 0..10000</a>

%o (PARI) a(n,s=1,d=[])={for(i=1,n,print1(s",");d=concat(d,if(s,digits(s)));s=3*d[1];d=vecextract(d,"^1"));s}

%o (Haskell)

%o a248131 n = a248131_list !! n

%o a248131_list = 1 : (map (* 3) $

%o concatMap (map (read . return) . show) a248131_list)

%o -- _Reinhard Zumkeller_, Oct 02 2014

%Y Cf. A248128-A248130.

%Y Cf. A102251.

%K nonn,base

%O 0,2

%A _M. F. Hasler_, Oct 02 2014

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 03:51 EDT 2024. Contains 371264 sequences. (Running on oeis4.)