|
|
A019519
|
|
Concatenate odd numbers.
|
|
12
|
|
|
1, 13, 135, 1357, 13579, 1357911, 135791113, 13579111315, 1357911131517, 135791113151719, 13579111315171921, 1357911131517192123, 135791113151719212325, 13579111315171921232527, 1357911131517192123252729, 135791113151719212325272931
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
REFERENCES
|
S. Smarandoiu, Convergence of Smarandache continued fractions, Abstract 96T-11-195, Abstracts Amer. Math. Soc., 17 (No. 4, 1996), 680.
|
|
LINKS
|
|
|
FORMULA
|
Sequence grows like 10^K, where K = 2 + floor(log_10(n)) + floor(log_10(a(n-1))). More generally we may consider a(n)= F(a(n-1),n)*B^K + G(a(n-1),n); K = floor(log_B H(a(n-1),n)); F(a(n-1),n); G(a(n-1),n); H(a(n-1),n) integer polynomials; B integer. - Ctibor O. Zizka, Mar 08 2008
|
|
MAPLE
|
a:= proc(n) a(n):= `if`(n=1, 1, parse(cat(a(n-1), 2*n-1))) end:
|
|
MATHEMATICA
|
nn=20; With[{odds=Range[1, 2nn+1, 2]}, Table[FromDigits[Flatten[ IntegerDigits/@ Take[odds, n]]], {n, nn}]] (* Harvey P. Dale, Aug 14 2014 *)
|
|
PROG
|
(Python)
def a(n): return int("".join(map(str, range(1, 2*n, 2))))
(PARI) a(n)=my(s=""); for(k=1, n, s=Str(s, 2*k-1)); eval(s); \\ Michel Marcus, Dec 07 2021
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,nonn,easy
|
|
AUTHOR
|
R. Muller
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|