reviewed
approved
reviewed
approved
proposed
reviewed
editing
proposed
a(n) = a(n-1)*(10^K) + n*a(n-1); a(0)=1; K=floor(log_10 (n*a(n-1))).
1, 2, 6, 78, 8112, 81160560, 8116056486963360, 81160564869633656812395408743520, 8116056486963365681239540874352649284518957069254499163269948160
(PARI) a(n) = if (n==0, 1, my(x=a(n-1), K=log(n*x)\log(10)); x*(10^K) + n*x); \\ Michel Marcus, Mar 16 2022
Offset corrected. - _ by _R. J. Mathar_, Jun 19 2021
More terms from Michel Marcus, Mar 16 2022
approved
editing
editing
approved
a(n)=a(n-1)*(10^K) + n*a(n-1); a(0)=1; K=floor(log_10 (n*a(n-1))).
1,0,2
A136306 := proc(n)
option remember;
local k ;
if n = 0 then
1;
else
if n*procname(n-1) < 1 then
k := 0;
else
k := floor(log[10](n*procname(n-1))) ;
end if ;
procname(n-1)*(n+10^k) ;
end if;
end proc:
seq(A136306(n), n=0..10) ; # R. J. Mathar, Jun 19 2021
Offset corrected. - R. J. Mathar, Jun 19 2021
approved
editing
editing
approved
_Ctibor O. ZIZKA (ctibor.zizka(AT)seznam.cz), Zizka_, Mar 22 2008
approved
editing
a(n)=a(n-1)*(10^K) + n*a(n-1); a(0)=1; K=floor(log_10 n*a(n-1)).
1, 2, 6, 78, 8112, 81160560
1,2
Sequence generalized :
a(n)=[a(n-1)*B^F(a(n-1),n)]+G(a(n-1),n); a(0)=1; F(t),G(t)integer functions.
a(n)=a(n-1)*(10^K) + n + a(n-1); a(0)=1; K=floor(log_10 n + a(n-1)) + 1.
easy,nonn
Ctibor O. ZIZKA (ctibor.zizka(AT)seznam.cz), Mar 22 2008
approved