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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A089718 a(1) = 1, a(n) = number obtained by multiplying each digit of a(n-1) by n. May be called digitfactorial of n. 0
1, 2, 6, 24, 1020, 60120, 4207140, 32160568320, 2718954045547227180, 207010809050400405050407020207010800, 22077011088099055044004405505504407702202207701108800 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

MAPLE

str10:=proc(n) if n<>0 then RETURN(convert(n, base, 10)) else RETURN([0]) fi end:ds:=proc(s) local j: RETURN(add(s[j]*10^(j-1), j=1..nops(s))): end: ap:=1: for n from 1 to 12 do m:=ds([seq(op(str10(i*n)), i=str10(ap))]): printf("%d, ", m):ap:=m od: # C. Ronaldo

MATHEMATICA

nxt[{n_, a_}]:={n+1, FromDigits[Flatten[IntegerDigits/@((n+1)*IntegerDigits[ a])]]}; Transpose[NestList[nxt, {1, 1}, 10]][[2]] (* Harvey P. Dale, Mar 26 2015 *)

CROSSREFS

Sequence in context: A088258 A227886 A290961 * A123150 A086591 A173609

Adjacent sequences:  A089715 A089716 A089717 * A089719 A089720 A089721

KEYWORD

base,easy,nonn

AUTHOR

Amarnath Murthy, Nov 18 2003

EXTENSIONS

More terms from C. Ronaldo (aga_new_ac(AT)hotmail.com), Dec 25 2004

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 October 17 15:00 EDT 2019. Contains 328115 sequences. (Running on oeis4.)