login
This site is supported by donations to The OEIS Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

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
2, 4, 16, 16, 96, 96, 576, 5184, 31104, 279936, 1679616, 8398080, 58786560, 352719360, 1763596800, 1763596800, 14108774400, 56435097600, 169305292800, 169305292800, 169305292800, 1693052928000, 6772211712000, 13544423424000, 94810963968000, 853298675712000, 7679688081408000, 23039064244224000 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

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

LINKS

Table of n, a(n) for n=1..28.

E. Angelini, Multiplying a(n) by the n-th digit of S, Mar 23 2012

PROG

(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)))))

CROSSREFS

Sequence in context: A155893 A196202 A135569 * A217863 A186108 A131560

Adjacent sequences:  A210576 A210577 A210578 * A210580 A210581 A210582

KEYWORD

nonn,base

AUTHOR

Eric Angelini and M. F. Hasler (writeup), Mar 23 2012

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 18 03:13 EST 2019. Contains 319260 sequences. (Running on oeis4.)