A094028 -id:A094028 - cp's OEIS frontend

A218736 a(n) = (33^n - 1)/32.

0, 1, 34, 1123, 37060, 1222981, 40358374, 1331826343, 43950269320, 1450358887561, 47861843289514, 1579440828553963, 52121547342280780, 1720011062295265741, 56760365055743769454, 1873092046839544391983, 61812037545704964935440, 2039797239008263842869521

Offset: 0

M. F. Hasler, Nov 04 2012

Partial sums of powers of 33 (A009977).

Vincenzo Librandi, Table of n, a(n) for n = 0..600
Index entries related to partial sums.
Index entries related to q-numbers.
Index entries for linear recurrences with constant coefficients, signature (34,-33).

Cf. similar sequences of the form (k^n-1)/(k-1): A000225, A003462, A002450, A003463, A003464, A023000, A023001, A002452, A002275, A016123, A016125, A091030, A135519, A135518, A131865, A091045, A218721, A218722, A064108, A218724-A218734, A132469, A218737-A218753, A133853, A094028, A218723.

[n le 2 select n-1 else 34*Self(n-1)-33*Self(n-2): n in [1..20]]; // Vincenzo Librandi, Nov 07 2012

LinearRecurrence[{34, -33}, {0, 1}, 30] (* Vincenzo Librandi, Nov 07 2012 *)

A218736(n):=(33^n-1)/32$
makelist(A218736(n),n,0,30); /* Martin Ettl, Nov 05 2012 */

PARI
```
A218736(n)=33^n>>5
```

From Vincenzo Librandi, Nov 07 2012: (Start)
G.f.: x/((1 - x)*(1 - 33*x)).
a(n) = 34*a(n-1) - 33*a(n-2).
a(n) = floor(33^n/32). (End)
E.g.f.: exp(x)*(exp(32*x) - 1)/32. - Stefano Spezia, Mar 24 2023

A333402 Numbers m such that the largest digit in the decimal expansion of 1/m is 1.

Original entry on oeis.org

1, 9, 10, 90, 99, 100, 900, 909, 990, 999, 1000, 9000, 9009, 9090, 9900, 9990, 9999, 10000, 90000, 90009, 90090, 90900, 90909, 99000, 99900, 99990, 99999, 100000, 900000, 900009, 900090, 900900, 909000, 909090, 990000, 990099, 999000, 999900, 999990, 999999, 1000000

Offset: 1

Bernard Schott, Mar 19 2020

If m is a term, 10*m is also a term.
If m is a term then m has only digits {1}, {9}, {1,0} or {9,0} in its decimal representation, but this is not sufficient to be a term (see examples).
Some subsequences below (not exhaustive, see crossrefs):
m = 10^k, k >= 0, hence m is in A011557 = {1, 10, 100, 1000, 10000, ...};
m = 9*10^k, k >= 0, hence m is in A052268 = {9, 90, 900, 9000, 90000, ...};
m = 10^k-1, k >= 1, hence m is in A002283 = {9, 99, 999, 9999, 99999, ...};
m = 9*(10^k+1), k >= 1, hence m is in 9*A000533 = {99, 909, 9009, 90009, ...};
m = 9+100*(100^k-1)/11, k >= 0, hence m is in 9*A094028 = {9, 909, 90909, 9090909, ...}.

			As 1/101 = 0.009900990099..., 101 is not a term.
As 1/909 = 0.001100110011..., 909 is a term.
As 1/9099 = 0.000109902187..., 9099 is not a term.
As 1/9999 = 0.000100010001..., 9999 is also a term.

Index entries for sequences related to decimal expansion of 1/n

Cf. A333236, A333237 (similar, with 9).
Subsequences: A002283, A011557, A052268.
Subsequences: 9*A000533, 9*A094028, 9*A135577, 9*A261544, 9*A330135.

Select[Range[10^4], Max @ RealDigits[1/#][[1]] == 1 &] (* Amiram Eldar, Mar 19 2020 *)

from itertools import count, islice
def A333402_gen(startvalue=1): # generator of terms >= startvalue
    for m in count(max(startvalue,1)):
        k = 1
        while k <= m:
            k *= 10
        rset = {0}
        while True:
            k, r = divmod(k, m)
            if max(str(k)) > '1':
                break
            else:
                if r in rset:
                    yield m
                    break
            rset.add(r)
            k = r
            while k <= m:
                k *= 10
A333402_list = list(islice(A333402_gen(),30)) # Chai Wah Wu, Feb 17 2022

A333236(a(n))= 1.

More terms from Jinyuan Wang, Mar 19 2020

A015585 a(n) = 9a(n-1) + 10a(n-2).

Original entry on oeis.org

0, 1, 9, 91, 909, 9091, 90909, 909091, 9090909, 90909091, 909090909, 9090909091, 90909090909, 909090909091, 9090909090909, 90909090909091, 909090909090909, 9090909090909091, 90909090909090909, 909090909090909091, 9090909090909090909, 90909090909090909091

Offset: 0

Olivier Gérard

Number of walks of length n between any two distinct nodes of the complete graph K_11. Example: a(2)=9 because the walks of length 2 between the nodes A and B of the complete graph ABCDEFGHIJK are: ACB, ADB, AEB, AFB, AGB, AHB, AIB, AJB and AKB. - Emeric Deutsch, Apr 01 2004
Beginning with n=1 and a(1)=1, these are the positive integers whose balanced base-10 representations (A097150) are the first n digits of 1,-1,1,-1,.... Also, a(n) = (-1)^(n-1)*A014992(n) = |A014992(n)| for n >= 1. - Rick L. Shepherd, Jul 30 2004
General form: k=10^n-k. Also: A001045, A078008, A097073, A115341, A015518, A054878, A015521, A109499, A015531, A109500, A109501, A015552, A093134, A015565, A015577. - Vladimir Joseph Stephan Orlovsky, Dec 11 2008

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Jean-Paul Allouche, Jeffrey Shallit, Zhixiong Wen, Wen Wu, Jiemeng Zhang, Sum-free sets generated by the period-k-folding sequences and some Sturmian sequences, arXiv:1911.01687 [math.CO], 2019.
Index entries for linear recurrences with constant coefficients, signature (9,10).

Cf. A014992 (q-integers for q=-10), A097150.
Cf. A001045, A078008, A097073, A115341, A015518, A054878, A015521, A109499, A015531, A109500, A109501, A015552, A093134, A015565, A015577. - Vladimir Joseph Stephan Orlovsky, Dec 11 2008
Cf. A094028, A098610, A098611.

[Round(10^n/11): n in [0..30]]; // Vincenzo Librandi, Jun 24 2011

k=0;lst={k};Do[k=10^n-k;AppendTo[lst, k], {n, 0, 5!}];lst (* Vladimir Joseph Stephan Orlovsky, Dec 11 2008 *)
LinearRecurrence[{9,10},{0,1},30] (* Harvey P. Dale, Aug 08 2014 *)

a(n)=10^n\/11 \\ Charles R Greathouse IV, Jun 24 2011

[lucas_number1(n,9,-10) for n in range(0, 19)] # Zerinvary Lajos, Apr 26 2009

[abs(gaussian_binomial(n,1,-10)) for n in range(0,19)] # Zerinvary Lajos, May 28 2009

a(n) = 9*a(n-1) + 10*a(n-2).
From Emeric Deutsch, Apr 01 2004: (Start)
a(n) = 10^(n-1) - a(n-1).
G.f.: x/(1 - 9x - 10x^2). (End)
From Henry Bottomley, Sep 17 2004: (Start)
a(n) = round(10^n/11).
a(n) = (10^n - (-1)^n)/11.
a(n) = A098611(n)/11 = 9*A094028(n+1)/A098610(n). (End)
E.g.f.: exp(-x)*(exp(11*x) - 1)/11. - Elmo R. Oliveira, Aug 17 2024

Extended by T. D. Noe, May 23 2011

A147759 Palindromes formed from the reflected decimal expansion of the infinite concatenation of 1's and 0's.

Original entry on oeis.org

1, 11, 101, 1001, 10101, 101101, 1010101, 10100101, 101010101, 1010110101, 10101010101, 101010010101, 1010101010101, 10101011010101, 101010101010101, 1010101001010101, 10101010101010101, 101010101101010101

Offset: 1

Omar E. Pol, Nov 11 2008

a(k(n)) is divisible by 3 iff k(n) is defined by k(1) = 5 and k(n+1) - k(n) = A100285(n+2). - Altug Alkan, Dec 05 2015

			n .... Successive digits of a(n)
1 ............. ( 1 )
2 ............ ( 1 1 )
3 ........... ( 1 0 1 )
4 .......... ( 1 0 0 1 )
5 ......... ( 1 0 1 0 1 )
6 ........ ( 1 0 1 1 0 1 )
7 ....... ( 1 0 1 0 1 0 1 )
8 ...... ( 1 0 1 0 0 1 0 1 )
9 ..... ( 1 0 1 0 1 0 1 0 1 )
10 ... ( 1 0 1 0 1 1 0 1 0 1 )

Matthew Schulz, Table of n, a(n) for n = 1..1000
Index entries for linear recurrences with constant coefficients, signature (11,-20,110,-100).

Cf. A000533, A094028, A135577, A138120, A138144, A138145, A138146, A138721, A138826, A147757.

I:=[1,11,101,1001]; [n le 4 select I[n] else 11*Self(n-1)-20*Self(n-2)+110*Self(n-3)-100*Self(n-4): n in [1..30]]; // Vincenzo Librandi, Dec 05 2015

CoefficientList[Series[x/((1 - x) (1 - 10 x) (1 + 10 x^2)),{x, 0, 20}], x] (* Vincenzo Librandi, Dec 05 2015 *)
LinearRecurrence[{11,-20,110,-100},{1,11,101,1001},30] (* Harvey P. Dale, Apr 10 2022 *)

Vec(x/((1-x)*(1-10*x)*(1+10*x^2)) + O(x^30)) \\ Michel Marcus, Dec 05 2015

From R. J. Mathar, Feb 20 2009: (Start)
a(n) = 11*a(n-1)-20*a(n-2)+110*a(n-3)-100*a(n-4).
G.f.: x/((1-x)*(1-10*x)*(1+10*x^2)). (End)
E.g.f.: (exp(x)*(10*exp(9*x) - 1) - 9*cos(sqrt(10)*x))/99. - Stefano Spezia, Oct 12 2024

A350814 Numbers m such that the largest digit in the decimal expansion of 1/m is 3.

Original entry on oeis.org

3, 30, 33, 75, 300, 303, 330, 333, 429, 750, 813, 3000, 3003, 3030, 3125, 3300, 3330, 3333, 4290, 4329, 7500, 7575, 8130, 30000, 30003, 30030, 30300, 30303, 31250, 33000, 33300, 33330, 33333, 42900, 43290, 46875, 75000, 75075, 75750, 76923, 81103, 81300, 300000

Offset: 1

Bernard Schott, Jan 30 2022

If m is a term, 10*m is also a term.
3 is the only prime up to 2.6*10^8 (see comments in A333237).
Some subsequences:
{3, 30, 300, ...} = A093138 \ {1}.
{3, 33, 333, ...} = A002277 \ {0}.
{3, 33, 303, 3003, ...} = 3 * A000533.
{3, 303, 30303, 3030303, ...} = 3 * A094028.

			As 1/33 = 0.0303030303..., 33 is a term.
As 1/75 = 0.0133333333..., 75 is a term.
As 1/429 = 0.002331002331002331..., 429 is a term.

Index entries for sequences related to decimal expansion of 1/n

Cf. A000533, A094028, A266385, A333236.
Similar with largest digit k: A333402 (k=1), A341383 (k=2), A333237 (k=9).
Subsequences: A002277 \ {0}, A093138 \ {1}.
Decimal expansion: A010701 (1/3), A010674 (1/33).

Select[Range[10^5], Max[RealDigits[1/#][[1]]] == 3 &] (* Amiram Eldar, Jan 30 2022 *)

from fractions import Fraction
from itertools import count, islice
from sympy import n_order, multiplicity
def repeating_decimals_expr(f, digits_only=False):
    """ returns repeating decimals of Fraction f as the string aaa.bbb[ccc].
        returns only digits if digits_only=True.
    """
    a, b = f.as_integer_ratio()
    m2, m5 = multiplicity(2,b), multiplicity(5,b)
    r = max(m2,m5)
    k, m = 10**r, 10**n_order(10,b//2**m2//5**m5)-1
    c = k*a//b
    s = str(c).zfill(r)
    if digits_only:
        return s+str(m*k*a//b-c*m)
    else:
        w = len(s)-r
        return s[:w]+'.'+s[w:]+'['+str(m*k*a//b-c*m)+']'
def A350814_gen(startvalue=1): # generator of terms >= startvalue
    return filter(lambda m:max(repeating_decimals_expr(Fraction(1,m),digits_only=True)) == '3',count(max(startvalue,1)))
A350814_list = list(islice(A350814_gen(),10)) # Chai Wah Wu, Feb 07 2022

More terms from Amiram Eldar, Jan 30 2022

A144864 a(n) = (4*16^(n-1)-1)/3.

Original entry on oeis.org

1, 21, 341, 5461, 87381, 1398101, 22369621, 357913941, 5726623061, 91625968981, 1466015503701, 23456248059221, 375299968947541, 6004799503160661, 96076792050570581, 1537228672809129301, 24595658764946068821, 393530540239137101141, 6296488643826193618261, 100743818301219097892181

Offset: 1

Artur Jasinski, Sep 23 2008

Old name was: A144863, read as binary numbers, converted to base 10.
All numbers in this sequence for n>1 are congruent to 5 mod 16. - Artur Jasinski, Sep 25 2008
From Omar E. Pol, Sep 10 2011: (Start)
It appears that this is a bisection of A002450.
It appears that this is a bisection of A084241.
It appears that this is a bisection of A153497.
It appears that this is a bisection of A088556, if n>=2.
(End)
All of the above is trivially true. - Joerg Arndt, Aug 19 2014
The aerated sequence (b(n))n>=1 = [1, 0, 21, 0, 341, 0, 5461, 0, 87381, ...] is a fourth-order linear divisibility sequence; that is, a(n) divides a(m) whenever n divides m. It is the case P1 = 0, P2 = -9, Q = -4 of the 3-parameter family of 4th-order linear divisibility sequences found by Williams and Guy. - Peter Bala, Aug 26 2022

Vincenzo Librandi, Table of n, a(n) for n = 1..500
H. C. Williams and R. K. Guy, Some fourth-order linear divisibility sequences, Intl. J. Number Theory 7 (5) (2011) 1255-1277.
Index entries for linear recurrences with constant coefficients, signature (17,-16).

Cf. A001025, A002450, A013776, A056830, A084241, A088556, A094028, A098704, A131865, A135576, A144863, A153497.

Third quadrisection of Jacobsthal numbers A001045; the other quadrisections are A195156 (first), A139792 (second), and A141060 (fourth).

[16^n/12-1/3: n in [1..20]]; // Vincenzo Librandi, Aug 03 2011

Table[1/3 (-1 + 16^(n - 1)) + 16^(n - 1), {n, 1, 17}] (* Artur Jasinski, Sep 25 2008 *)
LinearRecurrence[{17,-16},{1,21},20] (* Harvey P. Dale, Jun 29 2022 *)

vector(66,n,(4*16^(n-1)-1)/3) \\ Joerg Arndt, Aug 19 2014

a(n) = 16^n/12 - 1/3; a(n) = 16*a(n-1) + 5, a(1)=1. - Artur Jasinski, Sep 25 2008
G.f.: x*(1+4*x) / ( (16*x-1)*(x-1) ). - R. J. Mathar, Jan 06 2011
a(n)=b such that Integral_{x=-Pi/2..Pi/2} (-1)^(n+1)*2^(2*n-3)*(cos((2*n-1)*x))/(5/4+sin(x)) dx = c+b*log(3). - Francesco Daddi, Aug 02 2011
a(n) = (2^(4*n-2)-1)/3. - Klaus Purath, Jan 31 2021
From Jianing Song, Aug 30 2022: (Start)
a(n) = A001045(4*n-2).
a(n+1) - a(n) = 10*A013776(n-1) = 20*A001025(n-1) for n >= 1.
a(n) = 10*A098704(n) + 1 = 20*A131865(n-2) + 1 for n >= 2. (End)
E.g.f.: (exp(16*x) - 4*exp(x) + 3)/12. - Stefano Spezia, Apr 18 2024

New name from Joerg Arndt, Aug 19 2014

A218750 a(n) = (47^n - 1)/46.

Original entry on oeis.org

0, 1, 48, 2257, 106080, 4985761, 234330768, 11013546097, 517636666560, 24328923328321, 1143459396431088, 53742591632261137, 2525901806716273440, 118717384915664851681, 5579717091036248029008, 262246703278703657363377, 12325595054099071896078720

Offset: 0

M. F. Hasler, Nov 04 2012

Partial sums of powers of 47 (A009991).

Vincenzo Librandi, Table of n, a(n) for n = 0..600
Index entries related to partial sums
Index entries related to q-numbers
Index entries for linear recurrences with constant coefficients, signature (48,-47)

Cf. similar sequences of the form (k^n-1)/(k-1): A000225, A003462, A002450, A003463, A003464, A023000, A023001, A002452, A002275, A016123, A016125, A091030, A135519, A135518, A131865, A091045, A218721, A218722, A064108, A218724-A218734, A132469, A218736-A218753, A133853, A094028, A218723.

Cf. A009991.

[n le 2 select n-1 else 48*Self(n-1) - 47*Self(n-2): n in [1..20]]; // Vincenzo Librandi, Nov 08 2012

Table[(47^n - 1)/46, {n, 0, 19}] (* Alonso del Arte, Nov 04 2012 *)
LinearRecurrence[{48, -47}, {0, 1}, 30] (* Vincenzo Librandi, Nov 08 2012 *)

A218750(n):=(47^n-1)/46$ makelist(A218750(n),n,0,30); /* Martin Ettl, Nov 07 2012 */

PARI
```
A218750(n)=47^n\46
```

a(n) = floor(47^n/46).
G.f.: x/(47*x^2-48*x+1) = x/((1-x)*(1-47*x)). [Colin Barker, Nov 06 2012]
a(0)=0, a(n) = 47*a(n-1) + 1. - Vincenzo Librandi, Nov 08 2012
a(n) = 48*a(n-1) - 47*a(n-2). - Wesley Ivan Hurt, Jan 25 2022
E.g.f.: exp(24*x)*sinh(23*x)/23. - Elmo R. Oliveira, Aug 27 2024

A218726 a(n) = (23^n - 1)/22.

Original entry on oeis.org

0, 1, 24, 553, 12720, 292561, 6728904, 154764793, 3559590240, 81870575521, 1883023236984, 43309534450633, 996119292364560, 22910743724384881, 526947105660852264, 12119783430199602073, 278755018894590847680, 6411365434575589496641, 147461404995238558422744

Offset: 0

M. F. Hasler, Nov 04 2012

Partial sums of powers of 23, q-integers for q=23: diagonal k=1 in triangle A022187.

Partial sums are in A014909. Also, the sequence is related to A014941 by A014941(n) = n*a(n) - Sum{a(i), i=0..n-1} for n > 0. - Bruno Berselli, Nov 07 2012

Vincenzo Librandi, Table of n, a(n) for n = 0..700
Index entries related to partial sums.
Index entries for linear recurrences with constant coefficients, signature (24,-23).

Cf. similar sequences of the form (k^n-1)/(k-1): A000225, A003462, A002450, A003463, A003464, A023000, A023001, A002452, A002275, A016123, A016125, A091030, A135519, A135518, A131865, A091045, A218721, A218722, A064108, A218724-A218734, A132469, A218736-A218753, A133853, A094028, A218723.

Cf. A014909, A014941, A022187.

[n le 2 select n-1 else 24*Self(n-1)-23*Self(n-2): n in [1..20]]; // Vincenzo Librandi, Nov 07 2012

LinearRecurrence[{24, -23}, {0, 1}, 30] (* Vincenzo Librandi, Nov 07 2012 *)
(23^Range[0,20]-1)/22 (* Harvey P. Dale, Nov 09 2012 *)

A218726(n):=(23^n-1)/22$
makelist(A218726(n),n,0,30); /* Martin Ettl, Nov 07 2012 */

PARI
```
A218726(n)=23^n\22
```

From Vincenzo Librandi, Nov 07 2012: (Start)
G.f.: x/((1-x)*(1-23*x)).
a(n) = floor(23^n/22).
a(n) = 24*a(n-1) - 23*a(n-2). (End)
E.g.f.: exp(12*x)*sinh(11*x)/11. - Elmo R. Oliveira, Aug 27 2024

A218732 a(n) = (29^n - 1)/28.

Original entry on oeis.org

0, 1, 30, 871, 25260, 732541, 21243690, 616067011, 17865943320, 518112356281, 15025258332150, 435732491632351, 12636242257338180, 366451025462807221, 10627079738421409410, 308185312414220872891, 8937374060012405313840, 259183847740359754101361

Offset: 0

M. F. Hasler, Nov 04 2012

Partial sums of powers of 29 (A009973).

Vincenzo Librandi, Table of n, a(n) for n = 0..600
Index entries related to partial sums.
Index entries for linear recurrences with constant coefficients, signature (30,-29).

Cf. similar sequences of the form (k^n-1)/(k-1): A000225, A003462, A002450, A003463, A003464, A023000, A023001, A002452, A002275, A016123, A016125, A091030, A135519, A135518, A131865, A091045, A218721, A218722, A064108, A218724-A218734, A132469, A218736-A218753, A133853, A094028, A218723.

Cf. A009973.

[n le 2 select n-1 else 30*Self(n-1)-29*Self(n-2): n in [1..20]]; // Vincenzo Librandi, Nov 07 2012

LinearRecurrence[{30, -29}, {0, 1}, 30] (* Vincenzo Librandi, Nov 07 2012 *)

A218732(n):=(29^n-1)/28$
makelist(A218732(n),n,0,30); /* Martin Ettl, Nov 07 2012 */

PARI
```
a(n)=29^n\28
```

a(n) = floor(29^n/28).
G.f.: x/((1-x)*(1-29*x)). - Vincenzo Librandi, Nov 07 2012
a(n) = 30*a(n-1) - 29*a(n-2). - Vincenzo Librandi, Nov 07 2012
E.g.f.: exp(15*x)*sinh(14*x)/14. - Elmo R. Oliveira, Aug 27 2024

A218733 a(n) = (30^n - 1)/29.

Original entry on oeis.org

0, 1, 31, 931, 27931, 837931, 25137931, 754137931, 22624137931, 678724137931, 20361724137931, 610851724137931, 18325551724137931, 549766551724137931, 16492996551724137931, 494789896551724137931, 14843696896551724137931, 445310906896551724137931, 13359327206896551724137931

Offset: 0

M. F. Hasler, Nov 04 2012

Partial sums of powers of 30 (A009974).

Vincenzo Librandi, Table of n, a(n) for n = 0..600
Index entries related to partial sums.
Index entries for linear recurrences with constant coefficients, signature (31,-30).

Cf. similar sequences of the form (k^n-1)/(k-1): A000225, A003462, A002450, A003463, A003464, A023000, A023001, A002452, A002275, A016123, A016125, A091030, A135519, A135518, A131865, A091045, A218721, A218722, A064108, A218724-A218734, A132469, A218736-A218753, A133853, A094028, A218723.

Cf. A009974.

[n le 2 select n-1 else 31*Self(n-1) - 30*Self(n-2): n in [1..20]]; // Vincenzo Librandi, Nov 07 2012

LinearRecurrence[{31, -30}, {0, 1}, 30] (* Vincenzo Librandi, Nov 07 2012 *)
(30^Range[0,20]-1)/29 (* Harvey P. Dale, Nov 22 2022 *)

A218733(n):=floor((30^n-1)/29)$ makelist(A218733(n),n,0,30); /* Martin Ettl, Nov 05 2012 */

PARI
```
A218733(n)=30^n\29
```

a(n) = floor(30^n/29).
From Vincenzo Librandi, Nov 07 2012: (Start)
G.f.: x/((1-x)*(1-30*x)).
a(n) = 31*a(n-1) - 30*a(n-2). (End)
E.g.f.: exp(x)*(exp(29*x) - 1)/29. - Elmo R. Oliveira, Aug 29 2024

cp's OEIS Frontend

A218736 a(n) = (33^n - 1)/32.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

Maxima

PARI

Formula

A333402 Numbers m such that the largest digit in the decimal expansion of 1/m is 1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Python

Formula

Extensions

A015585 a(n) = 9*a(n-1) + 10*a(n-2).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Sage

Sage

Formula

Extensions

A147759 Palindromes formed from the reflected decimal expansion of the infinite concatenation of 1's and 0's.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A350814 Numbers m such that the largest digit in the decimal expansion of 1/m is 3.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Python

Extensions

A144864 a(n) = (4*16^(n-1)-1)/3.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

Extensions

A015585 a(n) = 9a(n-1) + 10a(n-2).