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!)
A136309 a(n) = a(n-1) * 10^K + n + a(n-1); a(0) = 1; K = floor(log_10(n + a(n-1) + 1)). 0
1, 3, 8, 91, 1005, 1006010, 1006011006016, 1006011006017006011006023, 1006011006017006011006024006011006017006011006031, 1006011006017006011006024006011006017006011006032006011006017006011006024006011006017006011006040 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
MAPLE
terms:=10: a:=array(1..terms): a[1]:=1: for n from 1 to terms-1 do K:=ilog10(n+a[n]+1); a[n+1]:=a[n]*(10^K)+n+a[n] end do: print(a); # Michal Paulovic, Sep 24 2023
PROG
(PARI) a(n) = my(t=1); for(n=1, n-1, my(K=logint(n+t+1, 10)); t = t*(10^K)+n+t); t \\ Michal Paulovic, Sep 24 2023
CROSSREFS
Sequence in context: A367273 A070901 A079657 * A266671 A069703 A114737
KEYWORD
easy,nonn,less
AUTHOR
Ctibor O. Zizka, Mar 22 2008
EXTENSIONS
Offset corrected by R. J. Mathar, Jun 20 2021
Name corrected and terms extended by Michal Paulovic, Sep 24 2023
STATUS
approved

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 September 1 15:00 EDT 2024. Contains 375591 sequences. (Running on oeis4.)