A002276 -id:A002276 - cp's OEIS frontend

A180160 (sum of digits) mod (number of digits) of n in decimal representation.

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 2, 0, 1, 2

Offset: 0

Reinhard Zumkeller, Aug 15 2010

a(n) = A007953(n) mod A055642(n);
a(A061383(n)) = 0; a(A180157(n)) > 0;
a(repdigits)=0: a(A010785(n))=0: a(A002275(n))=0: a(A002276(n))=0: a(A002277(n))=0: a(A002278(n))=0: a(4(n))=0: a(A002279(n))=0: a(A002280(n))=0: a(A002281(n))=0: a(A002282(n))=0: a(A002283(n))=0;
A123522 gives smallest m such that a(m) = n.

Reinhard Zumkeller, Table of n, a(n) for n = 0..25000

Cf. A002275-A002283, A007953, A010785, A055642, A061383, A123522, A180157, A374097.

A180160[n_] := If[n == 0, 0, Mod[Total[#], Length[#]] & [IntegerDigits[n]]];
Array[A180160, 100, 0] (* Paolo Xausa, Jun 30 2024 *)
Join[{0},Table[Mod[Total[IntegerDigits[n]],IntegerLength[n]],{n,110}]] (* Harvey P. Dale, Jul 30 2025 *)

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

Original entry on oeis.org

2, 4, 8, 18, 20, 22, 32, 40, 66, 74, 80, 180, 185, 198, 200, 220, 222, 320, 396, 400, 444, 492, 660, 666, 702, 704, 738, 740, 800, 803, 876, 1800, 1818, 1845, 1848, 1850, 1875, 1912, 1980, 1998, 2000, 2200, 2220, 2222, 2409, 2424, 2466, 2849, 3075, 3200, 3212, 3276, 3960, 3996, 4000

Offset: 1

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

If k is a term, 10*k is also a term.
First few primitive terms are 2, 4, 8, 18, 22, 32, 66, 74, 185, 198, 222, 396, ...
2 and 4649 are the only primes up to 2.6*10^8 (see comments in A333237).
Some subsequences:
{2, 22, 222, 2222, ...} = A002276 \ {0}.
{66, 666, 6666, ...} = A002280 \ {0, 6}.
{18, 1818, 181818, ...} = 18 * A094028.

			As 1/8 = 0.125, 8 is a term.
As 1/4649 = 0.000215121512151..., 4649 is a term.

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

Subsequences: A002276, A002280.
Similar with largest digit k: A333402 (k=1), A341383 (k=2), A350814 (k=3), A351470 (k=4), this sequence (k=5), A351472 (k=6), A351473 (k=7), A351474 (k=8), A333237 (k=9).
Cf. A333236.

f[n_] := Union[ Flatten[ RealDigits[ 1/n][[1]] ]]; Select[Range@1500000, Max@ f@# == 5 &]

from itertools import count, islice
from sympy import n_order, multiplicity
def A351471_gen(startvalue=1): # generator of terms >= startvalue
    for m in count(max(startvalue, 1)):
        m2, m5 = multiplicity(2, m), multiplicity(5, m)
        if max(str(10**(max(m2, m5)+n_order(10, m//2**m2//5**m5))//m)) == '5':
            yield m
A351471_list = list(islice(A351471_gen(), 10)) # Chai Wah Wu, Feb 15 2022

A111066 Numbers with digits 1 and 2 and at least one of each.

Original entry on oeis.org

12, 21, 112, 121, 122, 211, 212, 221, 1112, 1121, 1122, 1211, 1212, 1221, 1222, 2111, 2112, 2121, 2122, 2211, 2212, 2221, 11112, 11121, 11122, 11211, 11212, 11221, 11222, 12111, 12112, 12121, 12122, 12211, 12212, 12221, 12222, 21111, 21112, 21121, 21122, 21211

Offset: 1

Alexandre Wajnberg & Youri Mora, Oct 08 2005

Harvey P. Dale, Table of n, a(n) for n = 1..1000

Equals A007931 minus A000042 and A002276. Supersequence of A214218.

Cf. A043494, A037415, A062289, A000225.

FromDigits /@ Select[ IntegerDigits[ Range[210], 3], Union[ # ] == {1, 2} &] (* Robert G. Wilson v, Oct 09 2005 *)
Union[FromDigits/@Select[Flatten[Table[Tuples[{1,2},n],{n,2,5}],1], Union[#] == {1,2}&]] (* Harvey P. Dale, Sep 05 2013 *)

from itertools import count, islice
def agen():
    for i in count(1):
        s = bin(i+1)[3:].replace('1', '2').replace('0', '1')
        if 0 < s.count('1') < len(s):
            yield int(s)
print(list(islice(agen(), 42))) # Michael S. Branicky, Dec 21 2021

More terms from Robert G. Wilson v, Oct 09 2005

Crossrefs from Charles R Greathouse IV, Aug 03 2010

A137233 Number of n-digit even numbers.

Original entry on oeis.org

5, 45, 450, 4500, 45000, 450000, 4500000, 45000000, 450000000, 4500000000, 45000000000, 450000000000, 4500000000000, 45000000000000, 450000000000000, 4500000000000000, 45000000000000000, 450000000000000000, 4500000000000000000, 45000000000000000000, 450000000000000000000

Offset: 1

Ctibor O. Zizka, Mar 08 2008

From Kival Ngaokrajang, Oct 18 2013: (Start)
a(n) is also the total number of double rows identified numbers in n digit.
For example:
  n = 1: 01 23 45 67 89 = 5 double rows;
  n = 2: 1011 1213 1415 1617 1819...9899 = 45 double rows;
  n = 3: 100101 102103 104105...998999 = 450 double rows;
The number of double rows is also A030656. (End)
a(n) is also the number of n-digit integers with an even number of even digits (A356929); a(5) = 45000 is the answer to the question 2 of the Olympiade Mathématique Belge in 2004 (link). - Bernard Schott, Sep 06 2022
a(n) is also the number of n-digit integers with an odd number of odd digits (A054684). - Bernard Schott, Nov 07 2022

			a(2) = 45 because there are 45 2-digit even numbers.

Olympiade Mathématique Belge, OMB 2004, Finale Maxi, Question 2.
Index to sequences related to Olympiads.
Index entries for linear recurrences with constant coefficients, signature (10).

Cf. A000422, A002275, A002276, A011577, A014923, A014925, A016313, A019518, A037487, A053052, A057138, A090843, A097166, A099914, A099915.

Cf. A030656, A052268, A054684, A356929.

Vec(5*x*(1-x)/(1-10*x) + O(x^22)) \\ Elmo R. Oliveira, Jul 23 2025

def A137233(n): return 9*10**(n-1)+1>>1 # Chai Wah Wu, Nov 11 2022

a(n) = 9*10^(n-1)/2 if n > 1. - R. J. Mathar, May 23 2008
From Elmo R. Oliveira, Jul 23 2025: (Start)
G.f.: 5*x*(1-x)/(1-10*x).
E.g.f.: (-9 + 10*x + 9*exp(10*x))/20.
a(n) = 10*a(n-1) for n > 2.
a(n) = A052268(n)/2 for n >= 2. (End)

Corrected and extended by R. J. Mathar, May 23 2008

More terms from Elmo R. Oliveira, Jul 23 2025

A348488 Positive numbers whose square starts and ends with exactly one 4.

Original entry on oeis.org

2, 22, 68, 202, 208, 218, 222, 642, 648, 652, 658, 672, 678, 682, 692, 698, 702, 2002, 2008, 2018, 2022, 2028, 2032, 2042, 2048, 2052, 2058, 2068, 2072, 2078, 2082, 2092, 2122, 2128, 2132, 2142, 2148, 2152, 2158, 2168, 2172, 2178, 2182, 2192, 2198, 2202, 2208, 2218, 2222, 2228

Offset: 1

Bernard Schott, Oct 24 2021

When a square ends with 4 (A273375), this square may end with precisely one 4, two 4's or three 4's (A328886).
This sequence is infinite as each 2*(10^m + 1), m >= 1 or 2*(10^m + 4), m >= 2 is a term.
Numbers 2, 22, 222, ..., 2*(10^k - 1) / 9, (k >= 1), as well as numbers 2228, 22228, ..., 2*(10^k + 52) / 9, (k >= 4) are terms and have no digits 0. - Marius A. Burtea, Oct 24 2021

			22 is a term since 22^2 = 484.
638 is not a term since 638^2 = 407044.
668 is not a term since 668^2 = 446224.

Cf. A045858, A273375 (squares ending with 4), A017317, A328886 (squares ending with three 4).
Cf. A002276 \ {0} (a subsequence).
Subsequence of A305719.
Similar to: A348487 (k=1), this sequence (k=4), A348489 (k=5), A348490 (k=6).

[2] cat [n:n in [4..2300]|Intseq(n*n)[1] eq 4 and Intseq(n*n)[#Intseq(n*n)] eq 4 and Intseq(n*n)[-1+#Intseq(n*n)] ne 4 and Intseq(n*n)[2] ne 4]; // Marius A. Burtea, Oct 24 2021

Join[{2}, Select[Range[10, 2000], (d = IntegerDigits[#^2])[[1]] == d[[-1]] == 4 && d[[-2]] != 4 && d[[2]] != 4 &]] (* Amiram Eldar, Oct 24 2021 *)

isok(k) = my(d=digits(sqr(k))); (d[1]==4) && (d[#d]==4) && if (#d>2, (d[2]!=4) && (d[#d-1]!=4), 1); \\ Michel Marcus, Oct 24 2021

from itertools import count, takewhile
def ok(n):
  s = str(n*n); return len(s.rstrip("4")) == len(s.lstrip("4")) == len(s)-1
def aupto(N):
  r = takewhile(lambda x: x<=N, (10*i+d for i in count(0) for d in [2, 8]))
  return [k for k in r if ok(k)]
print(aupto(2228)) # Michael S. Branicky, Oct 24 2021

A258643 Irregular triangle read by rows, n >= 1, k >= 0: T(n,k) is the number of distinct patterns of n X n squares with k holes that are squares (see the construction rule in comments).

Original entry on oeis.org

1, 1, 2, 1, 3, 1, 2, 9, 7, 4, 4, 5, 2, 25, 11, 40, 8, 33, 3, 16, 0, 4

Offset: 1

Kival Ngaokrajang, Jun 06 2015

The sequence of row lengths is A261243. - Wolfdieter Lang, Aug 18 2015
The construction rules are: (o) The n X n square has horizontal and vertical diagonals. (i) A pattern must be symmetric with respect to both vertical and horizontal axes. (ii) For n >= 2, each pattern must have four squares at the corners. (iii) The squares must have continuity contact to each other either by sides or corners. (iv) The hole(s) must be square(s). Mirror patterns with respect to the main diagonal are not considered as different. See illustration in the links.
Each pattern can be a seed of a box fractal; e.g., the second pattern of T(3,0), consisting of 5 squares and 0 holes, is a seed of the Vicsek fractal (see a link below); the second pattern of T(4,2), consisting of 10 squares and 2 holes, is a seed of the fractal in a link of A002276.
If the figures are rotated by 45 degrees in the clockwise direction they can be considered as binary bisymmetric n X n matrices B_n if a red square stand for 1 and an empty square for 0. The four corners have entries 1, that is B_n[1, 1] = 1 = B_n[1, n]. The continuity of the red squares, mentioned above in point (iii), means that there is no rectangular path of 0's (no diagonal steps) in the matrix B_n that dissects it into two parts. See A261242 for more details, where also the figures with nonsquare holes and the mirrors (row reversion in the B_n matrix) are considered. - Wolfdieter Lang, Aug 18 2015

			Irregular triangle begins:
n\k  0   1   2  3   4  5   6  7  8 ...
1    1
2    1
3    2   1
4    3   1   2
5    9   7   4  4   5  2
6   25  11  40  8  33  3  16  0  4
...

Kival Ngaokrajang, Illustration of pattern T(n,k) for n = 1..5, k >= 0, T(6,k) patterns
Wikipedia, Vicsek fractal

Cf. A002276 (10 squares, 2 holes), A016203 (8 squares, 0 holes), A023001 (8 squares, 1 hole), A218724 (21 squares, 4 holes).

Cf. A261242, A261243.

A332123 a(n) = 2*(10^(2n+1)-1)/9 + 10^n.

Original entry on oeis.org

3, 232, 22322, 2223222, 222232222, 22222322222, 2222223222222, 222222232222222, 22222222322222222, 2222222223222222222, 222222222232222222222, 22222222222322222222222, 2222222222223222222222222, 222222222222232222222222222, 22222222222222322222222222222, 2222222222222223222222222222222

Offset: 0

M. F. Hasler, Feb 09 2020

Index entries for linear recurrences with constant coefficients, signature (111,-1110,1000).

Cf. A002275 (repunits R_n = (10^n-1)/9), A002276 (2*R_n), A011557 (10^n).
Cf. A138148 (cyclops numbers with binary digits), A002113 (palindromes).
Cf. A332113 .. A332193 (variants with different repeated digit 1, ..., 9).
Cf. A332120 .. A332129 (variants with different middle digit 0, ..., 9).

A332123 := n -> 2*(10^(2*n+1)-1)/9+10^n;

Array[2 (10^(2 # + 1)-1)/9 + 10^# &, 15, 0]

apply( {A332123(n)=10^(n*2+1)\9*2+10^n}, [0..15])

def A332123(n): return 10**(n*2+1)//9*2+10**n

a(n) = 2*A138148(n) + 3*10^n = A002276(2n+1) + 10^n.
G.f.: (3 - 101*x - 100*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.

A332124 a(n) = 2(10^(2n+1)-1)/9 + 210^n.

Original entry on oeis.org

4, 242, 22422, 2224222, 222242222, 22222422222, 2222224222222, 222222242222222, 22222222422222222, 2222222224222222222, 222222222242222222222, 22222222222422222222222, 2222222222224222222222222, 222222222222242222222222222, 22222222222222422222222222222, 2222222222222224222222222222222

Offset: 0

M. F. Hasler, Feb 09 2020

Index entries for linear recurrences with constant coefficients, signature (111,-1110,1000).

Cf. A002275 (repunits R_n = (10^n-1)/9), A002276 (2*R_n), A011557 (10^n).
Cf. A138148 (cyclops numbers with binary digits), A002113 (palindromes).
Cf. A332114 .. A332194 (variants with different repeated digit 1, ..., 9).
Cf. A332120 .. A332129 (variants with different middle digit 0, ..., 9).

A332124 := n -> 2*((10^(2*n+1)-1)/9+10^n);

Array[2 ((10^(2 # + 1)-1)/9 + 10^#) &, 15, 0]
Table[FromDigits[Join[PadRight[{},n,2],{4},PadRight[{},n,2]]],{n,0,20}] (* or *) LinearRecurrence[{111,-1110,1000},{4,242,22422},20](* Harvey P. Dale, Mar 06 2023 *)

apply( {A332124(n)=(10^(n*2+1)\9+10^n)*2}, [0..15])

def A332124(n): return (10**(n*2+1)//9+10**n)*2

a(n) = 2*A138148(n) + 4*10^n = A002276(2n+1) + 2*10^n = 2*A332112(n).
G.f.: (4 - 202*x)/((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.

A332125 a(n) = 2(10^(2n+1)-1)/9 + 310^n.

Original entry on oeis.org

5, 252, 22522, 2225222, 222252222, 22222522222, 2222225222222, 222222252222222, 22222222522222222, 2222222225222222222, 222222222252222222222, 22222222222522222222222, 2222222222225222222222222, 222222222222252222222222222, 22222222222222522222222222222, 2222222222222225222222222222222

Offset: 0

M. F. Hasler, Feb 09 2020

Index entries for linear recurrences with constant coefficients, signature (111,-1110,1000).

Cf. A002275 (repunits R_n = (10^n-1)/9), A002276 (2*R_n), A011557 (10^n).
Cf. A138148 (cyclops numbers with binary digits), A002113 (palindromes).
Cf. A332115 .. A332195 (variants with different repeated digit 1, ..., 9).
Cf. A332120 .. A332129 (variants with different middle digit 0, ..., 9).

A332125 := n -> 2*(10^(2*n+1)-1)/9+3*10^n;

Array[2 (10^(2 # + 1)-1)/9 + 3*10^# &, 15, 0]

apply( {A332125(n)=10^(n*2+1)\9*2+3*10^n}, [0..15])

def A332125(n): return 10**(n*2+1)//9*2+3*10**n

a(n) = 2*A138148(n) + 5*10^n = A002276(2n+1) + 3*10^n.
G.f.: (5 - 303*x + 100*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.

A332126 a(n) = 2(10^(2n+1)-1)/9 + 410^n.

Original entry on oeis.org

6, 262, 22622, 2226222, 222262222, 22222622222, 2222226222222, 222222262222222, 22222222622222222, 2222222226222222222, 222222222262222222222, 22222222222622222222222, 2222222222226222222222222, 222222222222262222222222222, 22222222222222622222222222222, 2222222222222226222222222222222

Offset: 0

M. F. Hasler, Feb 09 2020

Index entries for linear recurrences with constant coefficients, signature (111,-1110,1000).

Cf. A002275 (repunits R_n = (10^n-1)/9), A002276 (2*R_n), A011557 (10^n).
Cf. A138148 (cyclops numbers with binary digits), A002113 (palindromes).
Cf. A332116 .. A332196 (variants with different repeated digit 1, ..., 9).
Cf. A332120 .. A332129 (variants with different middle digit 0, ..., 9).

A332126 := n -> 2*(10^(2*n+1)-1)/9+4*10^n;

Array[2 (10^(2 # + 1)-1)/9 + 4*10^# &, 15, 0]
Table[FromDigits[Join[PadRight[{},n,2],{6},PadRight[{},n,2]]],{n,0,20}] (* or *) LinearRecurrence[{111,-1110,1000},{6,262,22622},20] (* Harvey P. Dale, Oct 17 2021 *)

apply( {A332126(n)=10^(n*2+1)\9*2+4*10^n}, [0..15])

def A332126(n): return 10**(n*2+1)//9*2+4*10**n

a(n) = 2*A138148(n) + 6*10^n = A002276(2n+1) + 4*10^n = 2*A332113(n).
G.f.: (6 - 404*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.
E.g.f.: 2*exp(x)*(10*exp(99*x) + 18*exp(9*x) - 1)/9. - Stefano Spezia, Jul 13 2024

cp's OEIS Frontend

A180160 (sum of digits) mod (number of digits) of n in decimal representation.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Python

A111066 Numbers with digits 1 and 2 and at least one of each.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Python

Extensions

A137233 Number of n-digit even numbers.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Python

Formula

Extensions

A348488 Positive numbers whose square starts and ends with exactly one 4.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Magma

Mathematica

PARI

Python

A258643 Irregular triangle read by rows, n >= 1, k >= 0: T(n,k) is the number of distinct patterns of n X n squares with k holes that are squares (see the construction rule in comments).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A332123 a(n) = 2*(10^(2n+1)-1)/9 + 10^n.

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Python

Formula

A332124 a(n) = 2*(10^(2n+1)-1)/9 + 2*10^n.

Views

Author

Keywords

A332124 a(n) = 2(10^(2n+1)-1)/9 + 210^n.

A332125 a(n) = 2(10^(2n+1)-1)/9 + 310^n.

A332126 a(n) = 2(10^(2n+1)-1)/9 + 410^n.