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!)
A210579 a(1)=2, a(n+1)=a(n)*(n-th digit of the sequence or 10 in case of digit '0'). 0

%I #12 Jan 02 2023 12:30:48

%S 2,4,16,16,96,96,576,5184,31104,279936,1679616,8398080,58786560,

%T 352719360,1763596800,1763596800,14108774400,56435097600,169305292800,

%U 169305292800,169305292800,1693052928000,6772211712000,13544423424000,94810963968000,853298675712000,7679688081408000,23039064244224000

%N a(1)=2, a(n+1)=a(n)*(n-th digit of the sequence or 10 in case of digit '0').

%C a(1)=0 and a(1)=1 would yield constant sequences.

%H E. Angelini, <a href="http://list.seqfan.eu/oldermail/seqfan/2012-March/016625.html">Multiplying a(n) by the n-th digit of S</a>, Mar 23 2012

%o (PARI) S=[a=2];for(n=1,50,print1(a",");a*=if(S[1],S[1],10);S=concat(vecextract(S,"^1"),eval(Vec(Str(a)))))

%K nonn,base

%O 1,1

%A _Eric Angelini_ and _M. F. Hasler_ (writeup), Mar 23 2012

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 28 05:39 EDT 2024. Contains 371235 sequences. (Running on oeis4.)