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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A319955 a(1)=1; thereafter a(n+1) = a(n) + Product_{b=2..n+1} b^(1+floor(log_b(a(i)))). 0

%I #24 Jan 05 2021 05:04:53

%S 1,3,39,331815,114126085737676800331815

%N a(1)=1; thereafter a(n+1) = a(n) + Product_{b=2..n+1} b^(1+floor(log_b(a(i)))).

%H Jeffrey Shallit, <a href="http://www.numdam.org/item?id=JTNB_1996__8_2_347_0">Automaticity IV: Sequences, sets, and diversity</a>, J. Théor. Nombres Bordeaux 8.2 (1996): 347-367. See Theorem 10 p. 353, but b<=i+2 is a typo.

%o (PARI) a(n) = if (n==1, 1, a(n-1) + prod(b=2, n, b^(1+logint(a(n-1), b)))); \\ _Michel Marcus_, Jan 04 2021

%K nonn

%O 1,2

%A _N. J. A. Sloane_, Oct 04 2018

%E Name corrected by _Michel Marcus_, Jan 04 2021

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.

Last modified December 6 08:26 EST 2023. Contains 367600 sequences. (Running on oeis4.)