|
|
A332114
|
|
a(n) = (10^(2n+1)-1)/9 + 3*10^n.
|
|
6
|
|
|
4, 141, 11411, 1114111, 111141111, 11111411111, 1111114111111, 111111141111111, 11111111411111111, 1111111114111111111, 111111111141111111111, 11111111111411111111111, 1111111111114111111111111, 111111111111141111111111111, 11111111111111411111111111111, 1111111111111114111111111111111
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
See A107124 = {2, 3, 32, 45, 1544, ...} for the indices of primes.
|
|
LINKS
|
|
|
FORMULA
|
G.f.: (4 - 303*x + 200*x^2)/((1 - x)(1 - 10*x)(1 - 100*x)).
a(n) = 111*a(n-1) - 1110*a(n-2) + 1000*a(n-3) for n > 2.
|
|
MAPLE
|
A332114 := n -> (10^(2*n+1)-1)/9+3*10^n;
|
|
MATHEMATICA
|
Array[(10^(2 # + 1)-1)/9 + 3*10^# &, 15, 0]
|
|
PROG
|
(PARI) apply( {A332114(n)=10^(n*2+1)\9+3*10^n}, [0..15])
(Python) def A332114(n): return 10**(n*2+1)//9+3*10**n
|
|
CROSSREFS
|
Cf. A138148 (cyclops numbers with binary digits), A002113 (palindromes).
Cf. A332124 .. A332194 (variants with different repeated digit 2, ..., 9).
Cf. A332112 .. A332119 (variants with different middle digit 2, ..., 9).
|
|
KEYWORD
|
nonn,base,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|