A002281 -id:A002281 - cp's OEIS frontend

A002280 a(n) = 6*(10^n - 1)/9.

0, 6, 66, 666, 6666, 66666, 666666, 6666666, 66666666, 666666666, 6666666666, 66666666666, 666666666666, 6666666666666, 66666666666666, 666666666666666, 6666666666666666, 66666666666666666, 666666666666666666, 6666666666666666666, 66666666666666666666, 666666666666666666666

Offset: 0

N. J. A. Sloane

a(n-1) = number of Fibonacci numbers F(k), k <= 10^n, which end in 0. a(1)=6 because there are 6 Fibonacci numbers up to 10^2 which end in 0. - Shyam Sunder Gupta and Benoit Cloitre, Aug 15 2002

a(n) is the total number of holes in a certain triangle fractal (start with 10 triangles, 6 holes) after n iterations. See illustration in links. - Kival Ngaokrajang, Feb 21 2015

Ivan Panchenko, Table of n, a(n) for n = 0..200
Kival Ngaokrajang, Illustration of initial terms.
Index entries for linear recurrences with constant coefficients, signature (11,-10).

Different from A072912. Cf. A073548, etc.
Cf. A002275, A002276, A002277, A002278, A002279, A002281, A002282, A002283, A075415, A178631, A178633.
Cf. A010785, A017233, A073551.

LinearRecurrence[{11,-10},{0,6},20] (* Harvey P. Dale, Dec 20 2012 *)

a(n)=6*(10^n-1)/9 \\ Charles R Greathouse IV, Sep 24 2015

a(n) = 6*A002275(n).
From Jaume Oliver Lafont, Feb 03 2009: (Start)
G.f.: 6*x/((1-x)*(1-10*x)).
a(n) = 11*a(n-1) - 10*a(n-2) with a(0)=0, a(1)=6. (End)
a(n) = A178633(n)/A002283(n). - Reinhard Zumkeller, May 31 2010
a(n) = a(n-1) + 6*10^(n-1) with a(0)=0. - Vincenzo Librandi, Jul 22 2010
E.g.f.: 2*exp(x)*(exp(9*x) - 1)/3. - Stefano Spezia, Sep 13 2023
From Elmo R. Oliveira, Jul 21 2025: (Start)
a(n) = A073551(n+1)/2 for n >= 1.
a(n) = A010785(A017233(n-1)) for n >= 1. (End)

A002278 a(n) = 4*(10^n - 1)/9.

Original entry on oeis.org

0, 4, 44, 444, 4444, 44444, 444444, 4444444, 44444444, 444444444, 4444444444, 44444444444, 444444444444, 4444444444444, 44444444444444, 444444444444444, 4444444444444444, 44444444444444444, 444444444444444444, 4444444444444444444, 44444444444444444444, 444444444444444444444

Offset: 0

N. J. A. Sloane

Ivan Panchenko, Table of n, a(n) for n = 0..200
Index entries for linear recurrences with constant coefficients, signature (11,-10).

Cf. A002275, A002276, A002277, A002279, A002280, A002281, A002282, A002283, A075415, A178632.

Cf. A007091, A010785, A017209, A024049.

LinearRecurrence[{11, -10}, {0, 4}, 20] (* Robert G. Wilson v, Jul 06 2013 *)

a(n)=4*(10^n-1)/9 \\ Charles R Greathouse IV, Sep 24 2015

a(n) = A075415(n)/A002283(n). - Reinhard Zumkeller, May 31 2010
From Vincenzo Librandi, Jul 22 2010: (Start)
a(n) = a(n-1) + 4*10^(n-1) with a(0)=0;
a(n) = 11*a(n-1) - 10*a(n-2) with a(0)=0, a(1)=4. (End)
G.f.: 4*x/((1 - x)*(1 - 10*x)). - Ilya Gutkovskiy, Feb 24 2017
E.g.f.: 4*exp(x)*(exp(9*x) - 1)/9. - Stefano Spezia, Sep 13 2023
a(n) = A007091(A024049(n)). - Michel Marcus, Jun 16 2024
From Elmo R. Oliveira, Jul 19 2025: (Start)
a(n) = 4*A002275(n).
a(n) = A010785(A017209(n-1)) for n >= 1. (End)

A047855 a(n) = A047848(7,n).

Original entry on oeis.org

1, 2, 12, 112, 1112, 11112, 111112, 1111112, 11111112, 111111112, 1111111112, 11111111112, 111111111112, 1111111111112, 11111111111112, 111111111111112, 1111111111111112, 11111111111111112, 111111111111111112, 1111111111111111112, 11111111111111111112, 111111111111111111112

Offset: 0

Clark Kimberling

n-th difference of a(n), a(n-1), ..., a(0) is A001019(n-1) for n >= 1.
Range of A164898, apart from first term. - Reinhard Zumkeller, Aug 30 2009
a(n) is the number of integers less than or equal to 10^n, whose initial digit is 1. - Michel Marcus, Jul 04 2019
a(n) is 2^n represented in bijective base-2 numeration. - Alois P. Heinz, Aug 26 2019
This sequence proves both A028842 (numbers with prime product of digits) and A028843 (numbers with prime iterated product of digits) are infinite. Proof: Suppose either of those sequences is finite. Label as omega the supposed last term. Compute n = ceiling(log_10 omega) + 1. Then a(n) > omega. The product of digits of a(n) is 2, contradicting the assumption that omega is the final term of either A028842 or A028843. - Alonso del Arte, Apr 14 2020
For n >= 2, the concatenation of a(n) with 8*a(n) equals (3*R_n+3)^2, where R_n = A002275(n) is the repunit with n 1's; hence this sequence, except for {1,2}, is a subsequence of A115549. - Bernard Schott, Apr 30 2022

Ivan Panchenko, Table of n, a(n) for n = 0..200
Wikipedia, Bijective numeration.
Index entries for linear recurrences with constant coefficients, signature (11,-10).

Cf. A001019, A002275, A028842, A028843, A047848, A115549, A164898.

Cf. A002281, A062397.

[(10^n + 8)/9: n in [0..40]]; // G. C. Greubel, Jan 11 2025

a[0]:=0:a[1]:=1:for n from 2 to 50 do a[n]:=10*a[n-1]+1 od: seq(a[n]+1, n=0..18); # Zerinvary Lajos, Mar 20 2008

Join[{1}, Table[FromDigits[PadLeft[{2}, n, 1]], {n, 30}]] (* Harvey P. Dale, Apr 17 2013 *)
(10^Range[0, 29] + 8)/9 (* Alonso del Arte, Apr 12 2020 *)

a(n)=if(n==0,1,if(n==1,2,11*a(n-1)-10*a(n-2)))
for(i=0,10,print1(a(i),",")) \\ Lambert Klasen, Jan 28 2005

def A047855(n): return (pow(10,n) +8)//9
print([A047855(n) for n in range(41)]) # G. C. Greubel, Jan 11 2025

[gaussian_binomial(n,1,10)+1 for n in range(17)] # Zerinvary Lajos, May 29 2009

(List.fill(20)(10: BigInt)).scanLeft(1: BigInt)( * ).map(n => (n + 8)/9) // Alonso del Arte, Apr 12 2020

a(n) = (10^n + 8)/9. - Ralf Stephan, Feb 14 2004
a(0) = 1, a(1) = 2, a(n) = 11*a(n-1) - 10*a(n-2) for n > 1. - Lambert Klasen (lambert.klasen(AT)gmx.net), Jan 28 2005
G.f.: (1 - 9*x)/(1 - 11*x + 10*x^2). - Philippe Deléham, Oct 05 2009
a(n) = 10*a(n-1) - 8 (with a(0) = 1). - Vincenzo Librandi, Aug 06 2010
From Elmo R. Oliveira, Apr 03 2025: (Start)
E.g.f.: exp(x)*(8 + exp(9*x))/9.
a(n) = (A062397(n) - A002281(n))/2. (End)

More terms from Harvey P. Dale, Apr 17 2013

A352154 Numbers m such that the decimal expansion of 1/m contains the digit 0, ignoring leading and trailing 0's.

Original entry on oeis.org

11, 13, 17, 19, 21, 23, 27, 29, 31, 33, 34, 37, 38, 39, 41, 42, 43, 46, 47, 48, 49, 51, 52, 53, 57, 58, 59, 61, 62, 63, 67, 68, 69, 71, 73, 76, 77, 78, 79, 81, 83, 84, 85, 86, 87, 89, 91, 92, 93, 94, 95, 96, 97, 98, 99, 101, 102, 103, 105, 106, 107, 109, 110, 111, 113, 114

Offset: 1

Bernard Schott and Robert G. Wilson v, Mar 14 2022

Leading 0's are not considered, otherwise every integer >= 11 would be a term (see examples).
Trailing 0's are also not considered, otherwise numbers of the form 2^i*5^j with i, j >= 0, apart 1 (A003592) would be terms.
If k is a term, 10*k is also a term; so, terms with no trailing zeros are all primitive.
Some subsequences:
{11, 111, 1111, ...} = A002275 \ {0, 1}
{33, 333, 3333, ...} = A002277 \ {0, 3}.
{77, 777, 7777, ...} = A002281 \ {0, 7}
{11, 101, 1001, 10001, ...} = A000533 \ {1}.

			m = 13 is a term since 1/13 = 0.0769230769230769230... has a periodic part = '07692307' or '76923070' with a 0.
m = 14 is not a term since 1/14 = 0.0714285714285714285... has a periodic part = '714285' which has no 0 (the only 0 is a leading 0).

Robert Israel, Table of n, a(n) for n = 1..10000

Cf. A333402, A341383, A350814.
Similar with smallest digit k: this sequence (k=0), A352155 (k=1), A352156 (k=2), A352157 (k=3), A352158 (k=4), A352159 (k=5), A352160 (k=6), A352153 (no known term for k=7), A352161 (k=8), no term (k=9).
Cf. A000533, A002275, A002277, A002281.

removeInitial0:= proc(L) local i;
  for i from 1 to nops(L) do if L[i] <> 0 then return L[i..-1] fi od;
  []
end proc:
filter:= proc(n) local q;
  q:= NumberTheory:-RepeatingDecimal(1/n);
  member(0, removeInitial0(NonRepeatingPart(q))) or member(0, RepeatingPart(q))
end proc:
select(filter, [$1..300]); # Robert Israel, Apr 26 2023

f[n_] := Union[ Flatten[ RealDigits[ 1/n][[1]] ]]; Select[ Range@ 200, Min@ f@# == 0 &]

A352153(a(n)) = 0.

A178630 a(n) = 18*((10^n - 1)/9)^2.

Original entry on oeis.org

18, 2178, 221778, 22217778, 2222177778, 222221777778, 22222217777778, 2222222177777778, 222222221777777778, 22222222217777777778, 2222222222177777777778, 222222222221777777777778, 22222222222217777777777778, 2222222222222177777777777778, 222222222222221777777777777778

Offset: 1

Reinhard Zumkeller, May 31 2010

			n=1: ..................... 18 = 9 * 2;
n=2: ................... 2178 = 99 * 22;
n=3: ................. 221778 = 999 * 222;
n=4: ............... 22217778 = 9999 * 2222;
n=5: ............. 2222177778 = 99999 * 22222;
n=6: ........... 222221777778 = 999999 * 222222;
n=7: ......... 22222217777778 = 9999999 * 2222222;
n=8: ....... 2222222177777778 = 99999999 * 22222222;
n=9: ..... 222222221777777778 = 999999999 * 222222222.

G. C. Greubel, Table of n, a(n) for n = 1..200
Index entries for linear recurrences with constant coefficients, signature (111,-1110,1000).

Cf. A059988, A075412, A075415, A178631, A178632, A178633, A178634, A178635.

Cf. A002276, A002281, A002283, A002477.

List([1..20], n -> 18*((10^n-1)/9)^2); # G. C. Greubel, Jan 28 2019

[18*((10^n - 1)/9)^2: n in [1..20]]; // Vincenzo Librandi, Dec 28 2010

Table[18*((10^n-1)/9)^2, {n, 1, 20}] (* G. C. Greubel, Jan 28 2019 *)

a(n)=18*(10^n\9)^2 \\ Charles R Greathouse IV, Aug 21 2011

[18*((10^n-1)/9)^2 for n in (1..20)] # G. C. Greubel, Jan 28 2019

a(n) = 18*A002477(n) = A002283(n)*A002276(n).
a(n)=((A002276(n-1)*10 + 1)*10^(n-1) + A002281(n-1))*10 + 8.
G.f.: 18*x*(1 + 10*x)/((1 - x)*(1 - 10*x)*(1 - 100*x)). - Ilya Gutkovskiy, Feb 24 2017
From Elmo R. Oliveira, Jul 30 2025: (Start)
E.g.f.: 2*exp(x)*(1 - 2*exp(9*x) + exp(99*x))/9.
a(n) = 111*a(n-1) - 1110*a(n-2) + 1000*a(n-3) for n > 3. (End)

A178634 a(n) = 63*((10^n - 1)/9)^2.

Original entry on oeis.org

63, 7623, 776223, 77762223, 7777622223, 777776222223, 77777762222223, 7777777622222223, 777777776222222223, 77777777762222222223, 7777777777622222222223, 777777777776222222222223, 77777777777762222222222223, 7777777777777622222222222223, 777777777777776222222222222223

Offset: 1

Reinhard Zumkeller, May 31 2010

			n=1: ..................... 63 = 9 * 7;
n=2: ................... 7623 = 99 * 77;
n=3: ................. 776223 = 999 * 777;
n=4: ............... 77762223 = 9999 * 7777;
n=5: ............. 7777622223 = 99999 * 77777;
n=6: ........... 777776222223 = 999999 * 777777;
n=7: ......... 77777762222223 = 9999999 * 7777777;
n=8: ....... 7777777622222223 = 99999999 * 77777777;
n=9: ..... 777777776222222223 = 999999999 * 777777777.

Albert H. Beiler, Recreations in the theory of numbers, New York, Dover, (2nd ed.) 1966. See Table 33 at p. 62.
Walther Lietzmann, Lustiges und Merkwuerdiges von Zahlen und Formen, (F. Hirt, Breslau 1921-43), p. 149.

G. C. Greubel, Table of n, a(n) for n = 1..200
Index entries for linear recurrences with constant coefficients, signature (111,-1110,1000).

Cf. A059988, A075412, A075415, A178630, A178631, A178632, A178633, A178635.

Cf. A002276, A002281, A002283, A002477.

List([1..20], n -> 63*((10^n - 1)/9)^2); # G. C. Greubel, Jan 28 2019

[63*((10^n - 1)/9)^2: n in [1..20]]; // Vincenzo Librandi, Dec 28 2010

63((10^Range[15]-1)/9)^2 (* or *) Table[FromDigits[Join[PadRight[{},n,7],{6},PadRight[{},n,2],{3}]],{n,0,15}] (* Harvey P. Dale, Apr 23 2012 *)

a(n)=63*(10^n\9)^2 \\ Charles R Greathouse IV, Jul 02 2013

[63*((10^n - 1)/9)^2 for n in (1..20)] # G. C. Greubel, Jan 28 2019

a(n) = 63*A002477(n) = A002283(n)*A002281(n).
a(n) = ((A002281(n-1)*10 + 6)*10^(n-1) + A002276(n-1))*10 + 3.
G.f.: 63*x*(1 + 10*x)/((1 - x)*(1 - 10*x)*(1 - 100*x)). - Ilya Gutkovskiy, Feb 24 2017
E.g.f.: 7*exp(x)*(1 - 2*exp(9*x) + exp(99*x))/9. - Stefano Spezia, Jul 31 2024
a(n) = 111*a(n-1) - 1110*a(n-2) + 1000*a(n-3) for n > 3. - Elmo R. Oliveira, Aug 01 2025

A276039 Numbers using only digits 1 and 7.

Original entry on oeis.org

1, 7, 11, 17, 71, 77, 111, 117, 171, 177, 711, 717, 771, 777, 1111, 1117, 1171, 1177, 1711, 1717, 1771, 1777, 7111, 7117, 7171, 7177, 7711, 7717, 7771, 7777, 11111, 11117, 11171, 11177, 11711, 11717, 11771, 11777, 17111, 17117, 17171, 17177, 17711, 17717, 17771, 17777

Offset: 1

Vincenzo Librandi, Aug 19 2016

Numbers k such that the product of digits of k is a power of 7.

There are no prime terms whose number of digits is divisible by 3: for every d that is a multiple of 3, every d-digit number j consisting of no digits other than 1's and 7's will have a digit sum divisible by 3, so j will also be divisible by 3. - Mikk Heidemaa, Mar 27 2021

			7717 is in the sequence because 7*7*1*7 = 343 = 7^3.

David A. Corneth, Table of n, a(n) for n = 1..10000

Cf. similar sequences listed in A276037.

Cf. A020455, A002275, A002281, A034054.

[n: n in [1..24000] | Set(Intseq(n)) subset {1,7}];

Select[Range[20000], IntegerQ[Log[7, Times@@(IntegerDigits[#])]] &] (* or *) Flatten[Table[FromDigits/@Tuples[{1, 7}, n], {n, 6}]]

is(n) = my(d=digits(n), e=[0, 2, 3, 4, 5, 6, 8, 9]); if(#setintersect(Set(d), Set(e))==0, return(1), return(0)) \\ Felix Fröhlich, Aug 19 2016

a(n) = { my(b = binary(n + 1)); b = b[^1]; b = apply(x -> 6*x + 1, b); fromdigits(b) } \\ David A. Corneth, Mar 27 2021

def a(n):
  b = bin(n+1)[3:]
  return int("".join(b.replace("1", "7").replace("0", "1")))
print([a(n) for n in range(1, 47)]) # Michael S. Branicky, Mar 27 2021

def A276039(n): return 6*int(bin(n+1)[3:])+(10**((n+1).bit_length()-1)-1)//9 # Chai Wah Wu, Jun 28 2025

A083829 Palindromes k such that 3k + 1 is also a palindrome.

Original entry on oeis.org

1, 2, 7, 77, 141, 151, 161, 242, 252, 262, 777, 7777, 14041, 14141, 14241, 15051, 15151, 15251, 16061, 16161, 16261, 24042, 24142, 24242, 25052, 25152, 25252, 26062, 26162, 26262, 77777, 777777, 1404041, 1405041, 1406041, 1414141, 1415141

Offset: 1

Amarnath Murthy and Meenakshi Srikanth (menakan_s(AT)yahoo.com), May 09 2003

From Robert Israel, Feb 23 2023: (Start)

Includes A002281. It appears that the only terms with an even number of digits are in A002281. All other terms of more than 1 digit start with 14, 15, 16, 24, 25 or 26. It also appears that no terms contain the digits 3, 8 or 9, and the only ones that contain 7 are A002281. (End)

Robert Israel, Table of n, a(n) for n = 1..6576

Cf. A083830.

ispali:= proc(n) local L;
  L:= convert(n,base,10);
  L = ListTools:-Reverse(L)
end proc:
revdigs:= proc(n) local L,i;
  L:= convert(n,base,10);
  add(L[-i]*10^(i-1),i=1..nops(L))
end proc:
palis:= proc(d) local r;
  if d::even then [seq](revdigs(r)+10^(d/2)*r,r=10^(d/2-1)..10^(d/2)-1)
  else [seq](revdigs(floor(r/10))+10^((d-1)/2)*r, r=10^((d-1)/2)..10^((d+1)/2)-1)
  fi
end proc:
[seq(op(select(t -> ispali(3*t+1), palis(d))),d=1..7)]; # Robert Israel, Feb 23 2023

Select[Range[15*10^5],AllTrue[{#,3#+1},PalindromeQ]&] (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Feb 14 2018 *)

Corrected and extended by Ray Chandler, May 21 2003

A086066 a(n) = Sum_{d in D(n)} 2^d, where D(n) = set of digits of n in decimal representation.

Original entry on oeis.org

1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 3, 2, 6, 10, 18, 34, 66, 130, 258, 514, 5, 6, 4, 12, 20, 36, 68, 132, 260, 516, 9, 10, 12, 8, 24, 40, 72, 136, 264, 520, 17, 18, 20, 24, 16, 48, 80, 144, 272, 528, 33, 34, 36, 40, 48, 32, 96, 160, 288, 544, 65, 66, 68, 72, 80

Offset: 0

Reinhard Zumkeller, Jul 08 2003

For bitwise logical operations AND and OR:
a(m) = (a(m) AND a(n)) iff D(m) is a subset of D(n),
(a(m) AND a(n)) = 0 iff D(m) and D(n) are disjoint,
a(m) = (a(m) OR a(n)) iff D(n) is a subset of D(m),
a(m) = a(n) iff D(m) = D(n);
A086067(n) = A007088(a(n)).
From Reinhard Zumkeller, Sep 18 2009: (Start)
a(A052382(n)) mod 2 = 0; a(A011540(n)) mod 2 = 1;
for n > 0: a(A000004(n))=1, a(A000042(n))=2, a(A011557(n))=3, a(A002276(n))=4, a(A111066(n))=6, a(A002277(n))=8, a(A002278(n))=16, a(A002279(n))=32, a(A002280(n))=64, a(A002281(n))=128, a(A002282(n))=256, a(A002283(n))=512;
a(n) <= 1023. (End)

			n=242, D(242) = {2,4}: a(242) = 2^2 + 2^4 = 20.

Nathaniel Johnston, Table of n, a(n) for n = 0..10000

A086066 := proc(n) local d: if(n=0)then return 1: fi: d:=convert(convert(n,base,10),set): return add(2^d[j],j=1..nops(d)): end: seq(A086066(n),n=0..64); # Nathaniel Johnston, May 31 2011

A256341 Numbers which have only digits 8 and 9 in base 10.

Original entry on oeis.org

8, 9, 88, 89, 98, 99, 888, 889, 898, 899, 988, 989, 998, 999, 8888, 8889, 8898, 8899, 8988, 8989, 8998, 8999, 9888, 9889, 9898, 9899, 9988, 9989, 9998, 9999, 88888, 88889, 88898, 88899, 88988, 88989, 88998, 88999, 89888, 89889

Offset: 1

M. F. Hasler, Mar 27 2015

Vincenzo Librandi, Table of n, a(n) for n = 1..8190
Index entries for 10-automatic sequences.

Cf. A007088 (digits 0 & 1), A007931 (digits 1 & 2), A032810 (digits 2 & 3), A032834 (digits 3 & 4), A256290 (digits 4 & 5) - A256292 (digits 6 & 7), A256340 (digits 7 & 8).

[n: n in [1..35000] | Set(IntegerToSequence(n, 10)) subset {8, 9}];

[n: n in [1..100000] | Set(Intseq(n)) subset {8,9}]; // Vincenzo Librandi, Aug 19 2016

Flatten[Table[FromDigits[#,10]&/@Tuples[{8,9},n],{n,5}]]

A256341(n)=vector(#n=binary(n+1)[2..-1],i,10^(#n-i))*n~+10^#n\9*8

def a(n): return int(bin(n+1)[3:].replace('0', '8').replace('1', '9'))
print([a(n) for n in range(1, 45)]) # Michael S. Branicky, Aug 09 2021

a(n) = A007931(n) + A002281(A000523(n+1)) = A256341(n) + A256077(n) etc.

cp's OEIS Frontend

A002280 a(n) = 6*(10^n - 1)/9.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A002278 a(n) = 4*(10^n - 1)/9.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A047855 a(n) = A047848(7,n).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Python

Sage

Scala

Formula

Extensions

A352154 Numbers m such that the decimal expansion of 1/m contains the digit 0, ignoring leading and trailing 0's.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A178630 a(n) = 18*((10^n - 1)/9)^2.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

GAP

Magma

Mathematica

PARI

Sage

Formula

A178634 a(n) = 63*((10^n - 1)/9)^2.

Views

Author

Keywords

Examples

References

Links

Crossrefs

Programs

GAP

Magma

Mathematica

PARI

Sage

Formula