A133900 -id:A133900 - cp's OEIS frontend

A362689 Binomial(n+p, n) mod n where p=9.

0, 1, 1, 3, 2, 1, 2, 6, 2, 8, 1, 2, 1, 10, 14, 15, 1, 3, 1, 5, 18, 1, 1, 12, 6, 14, 4, 12, 1, 22, 1, 13, 1, 1, 13, 23, 1, 1, 14, 34, 1, 14, 1, 34, 15, 24, 1, 27, 8, 11, 18, 1, 1, 7, 12, 16, 1, 30, 1, 28, 1, 32, 17, 25, 14, 23, 1, 35, 47, 25, 1, 54, 1, 38, 66

Offset: 1

Ray Chandler, Apr 29 2023

nonn

Ray Chandler, Table of n, a(n) for n = 1..1000
Index entries for linear recurrences with constant coefficients, order 5806080.

Cf. A000040, A133620-A133625, A133630, A038509, A133634-A133636.

Cf. A133875, A133885, A133880, A133890, A133900, A133910, A362686, A362687, A362688.

Mathematica
```
Table[Mod[Binomial[n+9,n],n],{n,90}]
```

a(n)=binomial(n+9,n) mod n.

For n > 5806081, a(n) = 2*a(n-2903040) - a(n-5806080).

A133882 a(n) = binomial(n+2,n) mod 2^2.

Original entry on oeis.org

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

Offset: 0

Hieronymus Fischer, Oct 10 2007

Periodic with length 2^3 = 8.

Antti Karttunen, Table of n, a(n) for n = 0..8191
Index entries for linear recurrences with constant coefficients, signature (1, -1, 1, -1, 1, -1, 1).

Cf. A000040, A133620-A133625, A133630, A038509, A133634-A133636.
Cf. A133872, A133880, A133890, A133900, A133910.
For the sequence regarding "binomial(n+2, n) mod 2" see A133872.
A105198 shifted once left.

Table[Mod[Binomial[n+2,n],4],{n,0,120}]  (* Harvey P. Dale, Apr 16 2011 *)

A133882(n) = (binomial(n+2,n) % 4); \\ Antti Karttunen, Aug 10 2017

a(n) = binomial(n+2,2) mod 2^2.
G.f.: (1 + 3*x + 2*x^2 + 2*x^3 + 3*x^4 + x^5)/(1-x^8).
G.f.: (1+x)*(1+2*x+2*x^3+x^4)/(1-x^8) = (1+2*x+2*x^3+x^4)/((1-x)*(1+x^2)*(1+x^4)).
a(n) = A105198(n+1). - R. J. Mathar, Jun 08 2008

A133883 a(n) = binomial(n+3,n) mod 3^2.

Original entry on oeis.org

1, 4, 1, 2, 8, 2, 3, 3, 3, 4, 7, 4, 5, 2, 5, 6, 6, 6, 7, 1, 7, 8, 5, 8, 0, 0, 0, 1, 4, 1, 2, 8, 2, 3, 3, 3, 4, 7, 4, 5, 2, 5, 6, 6, 6, 7, 1, 7, 8, 5, 8, 0, 0, 0, 1, 4, 1, 2, 8, 2, 3, 3, 3, 4, 7, 4, 5, 2, 5, 6, 6, 6, 7, 1, 7, 8, 5, 8, 0, 0, 0, 1, 4, 1, 2, 8, 2, 3, 3, 3, 4, 7, 4, 5, 2, 5, 6, 6, 6, 7, 1, 7, 8, 5, 8

Offset: 0

Hieronymus Fischer, Oct 10 2007

Periodic with length 3^3 = 27.

Colin Barker, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (1,0,-1,1,0,-1,1,0,-1,1,0,-1,1,0,-1,1,0,-1,1,0,-1,1,0,-1,1).

Cf. A000040, A133620-A133625, A133630, A038509, A133634-A133636.
Cf. A133873, A133880, A133890, A133900, A133910.
For the sequence regarding "Binomial(n+3, n) mod 3" see A133873.

[Binomial(n+3,n) mod 9: n in [0..60]]; // Vincenzo Librandi, Jul 20 2016

Table[Mod[Binomial[n + 3, n], 9], {n, 0, 120}] (* or *)
CoefficientList[Series[(1 + 3 x - 3 x^2 + 2 x^3 + 9 x^4 - 9 x^5 + 3 x^6 + 9 x^7 - 9 x^8 + 4 x^9 + 12 x^10 - 12 x^11 + 5 x^12 + 9 x^13 - 9 x^14 + 6 x^15 + 9 x^16 - 9 x^17 + 7 x^18 + 3 x^19 - 3 x^20 + 8 x^21)/((1 - x) (1 + x^3 + x^6) (1 + x^9 + x^18)), {x, 0, 120}], x] (* Michael De Vlieger, Jul 19 2016 *)

Vec((1 +3*x -3*x^2 +2*x^3 +9*x^4 -9*x^5 +3*x^6 +9*x^7 -9*x^8 +4*x^9 +12*x^10 -12*x^11 +5*x^12 +9*x^13 -9*x^14 +6*x^15 +9*x^16 -9*x^17 +7*x^18 +3*x^19 -3*x^20 +8*x^21) / ((1 -x)*(1 +x^3 +x^6)*(1 +x^9 +x^18)) + O(x^200)) \\ Colin Barker, Jul 19 2016

a(n) = binomial(n+3,3) mod 3^2.

G.f.: (1 +3*x -3*x^2 +2*x^3 +9*x^4 -9*x^5 +3*x^6 +9*x^7 -9*x^8 +4*x^9 +12*x^10 -12*x^11 +5*x^12 +9*x^13 -9*x^14 +6*x^15 +9*x^16 -9*x^17 +7*x^18 +3*x^19 -3*x^20 +8*x^21) / ((1 -x)*(1 +x^3 +x^6)*(1 +x^9 +x^18)). - Colin Barker, Jul 19 2016

Corrected g.f. by Colin Barker, Jul 19 2016

A133886 a(n) = binomial(n+6,n) mod 6.

Original entry on oeis.org

1, 1, 4, 0, 0, 0, 0, 0, 3, 1, 4, 4, 0, 0, 0, 0, 3, 3, 4, 4, 4, 0, 0, 0, 3, 3, 0, 4, 4, 4, 0, 0, 3, 3, 0, 0, 4, 4, 4, 0, 3, 3, 0, 0, 0, 4, 4, 4, 3, 3, 0, 0, 0, 0, 4, 4, 1, 3, 0, 0, 0, 0, 0, 4, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 4, 0, 0, 0, 0, 0, 3, 1, 4, 4, 0, 0, 0, 0, 3, 3, 4, 4, 4, 0, 0, 0, 3, 3, 0, 4, 4, 4, 0, 0, 3

Offset: 0

Hieronymus Fischer, Oct 10 2007

Periodic with length 2*6^2 = 72.

Ray Chandler, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (1, -1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, -1, 0, 0, -1, 0, 0, 0, -1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, -1, 0, 0, -1, 0, 0, 0, 0, 0, 1, -1, 1).

Cf. A000040, A133620-A133625, A133630, A038509, A133634-A133636.

Cf. A133876, A133880, A133890, A133900, A133910.

A133886:=n->binomial(n+6,6) mod 6; seq(A133886(n), n=0..100); # Wesley Ivan Hurt, Apr 30 2014

Table[Mod[Binomial[n+6,n],6],{n,0,110}] (* Harvey P. Dale, May 04 2013 *)

a(n) = binomial(n+6,6) mod 6.
G.f.: g(x) = (1+x+4*x^2-6*x^9-6*x^56+4*x^63+x^64+x^65+3*x^8*(1+x)(1-x^56)/(1-x^8)+4*x^9(1+x+x^2)(1-x^54)/(1-x^9))/(1-x^72).
a(n) = a(n-1)-a(n-2)+a(n-8)+a(n-11)-a(n-17)-a(n-20)-a(n-24)+a(n-25)+a(n-29)+ a(n-32)- a(n-38)-a(n-41)+a(n-47)-a(n-48)+a(n-49). - Harvey P. Dale, May 04 2013

A078177 Composite numbers with an integer arithmetic mean of all prime factors.

Original entry on oeis.org

4, 8, 9, 15, 16, 20, 21, 25, 27, 32, 33, 35, 39, 42, 44, 49, 50, 51, 55, 57, 60, 64, 65, 68, 69, 77, 78, 81, 85, 87, 91, 92, 93, 95, 105, 110, 111, 112, 114, 115, 116, 119, 121, 123, 125, 128, 129, 133, 140, 141, 143, 145, 155, 156, 159, 161, 164, 169, 170, 177, 180

Offset: 1

Reinhard Zumkeller, Nov 20 2002

nonn

That is, composite numbers such that the arithmetic mean of their prime factors (counted with multiplicity) is an integer.

			60 = 2*2*3*5: (2+2+3+5)/4 = 3, therefore 60 is a term.

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A078175, A001222, A100118, A046363, A133620, A133621.

Cf. A133880, A133890, A133900, A133910, A133911, A046346, A134331, A134332, A134333, A134334, A134344, A134376.

Select[Range[200], CompositeQ[#] && IntegerQ[Mean[Flatten[Table[#[[1]], #[[2]]]& /@ FactorInteger[#]]]]&] (* Jean-François Alcover, Aug 03 2018 *)

lista(nn) = {forcomposite(n=1, nn, my(f = factor(n)); if (! (sum(k=1, #f~, f[k,1]*f[k,2]) % vecsum(f[,2])), print1(n, ", ")););} \\ Michel Marcus, Feb 22 2016

A001414(a(n)) == 0 modulo A001222(a(n)).

Edited by N. J. A. Sloane, May 30 2008 at the suggestion of R. J. Mathar

A133873 n modulo 3 repeated 3 times.

Original entry on oeis.org

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

Offset: 0

Hieronymus Fischer, Oct 10 2007

Periodic with length 3^2=9.

Index entries for linear recurrences with constant coefficients, signature (1, 0, -1, 1, 0, -1, 1).

Cf. A000040, A133620-A133625, A133630, A038509, A133634-A133636.

Cf. A133883, A133880, A133890, A133900, A133910.

G.f.: (1 + 2*x^3)*(1 - x^3)/((1 - x)*(1 - x^9)).
a(n) = (1 + floor(n/3)) mod 3.
a(n) = A010872(A002264(n+3)).
a(n) = 1+floor(n/3)-3*floor((n+3)/9).
a(n) = (((n+3) mod 9)-(n mod 3))/3.
a(n) = ((n+3-(n mod 3))/3) mod 3.
a(n) = binomial(n+3,n) mod 3 = binomial(n+3,3) mod 3.

A133874 n modulo 4 repeated 4 times.

Original entry on oeis.org

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

Offset: 0

Hieronymus Fischer, Oct 10 2007

nonn

Periodic with length 4^2 = 16.

Index entries for linear recurrences with constant coefficients, signature (1, 0, 0, -1, 1, 0, 0, -1, 1, 0, 0, -1, 1).

Cf. A000040, A133620-A133625, A133630, A038509, A133634-A133636.

Cf. A133884, A133880, A133890, A133900, A133910.

Flatten[Table[Table[Mod[n,4],{4}],{n,30}]] (* Harvey P. Dale, Dec 22 2013 *)

def A133874(n): return 1+(n>>2)&3 # Chai Wah Wu, Jan 18 2023

a(n) = (1 + floor(n/4)) mod 4.
a(n) = A010873(A002265(n+4)).
a(n) = 1 + floor(n/4) - 4*floor((n+4)/16).
a(n) = (((n+4) mod 16) - (n mod 4))/4.
a(n) = ((n + 4 - (n mod 4))/4) mod 4.
G.f. g(x) = (1 + x + x^2 + x^3 + 2x^4 + 2x^5 + 2x^6 + 2x^7 + 3x^8 + 3x^9 + 3x^10 + 3x^11)/(1-x^16).
G.f. g(x) = ((1-x^4)*(1+2x^4+3x^8))/((1-x)*(1-x^16)).
G.f. g(x) = (3x^16-4x^12+1)/((1-x)*(1-x^4)*(1-x^16)).
G.f. g(x) = (1+2x^4+3x^8)/((1-x)*(1+x^4)*(1+x^8)).

A133884 a(n) = binomial(n+4,n) mod 4.

Original entry on oeis.org

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

Offset: 0

Hieronymus Fischer, Oct 10 2007

Periodic with length 4^2=16.

			For n=2, binomial(6,2) = 6*5/2 = 15, which is 3 (mod 4) so a(2) = 3. - _Michael B. Porter_, Jul 19 2016

Index entries for linear recurrences with constant coefficients, signature (1, 0, 0, -1, 1, 0, 0, -1, 1, 0, 0, -1, 1).

Cf. A000040, A133630, A038509.
Cf. A133620, A133621, A133622, A133623, A133624, A133625
Cf. A133634, A133635, A133636.
Cf. A133874, A133880, A133890, A133900, A133910.

[Binomial(n+4,n) mod 4: n in [0..100]]; // Vincenzo Librandi, Jul 15 2016

Table[Mod[Binomial[n + 4, 4], 4], {n, 0, 100}] (* Vincenzo Librandi, Jul 15 2016 *)

a(n) = binomial(n+4,4) mod 4.
G.f.: (1 + x + 3*x^2 + 3*x^3 + 2*x^4 + 2*x^5 + 2*x^6 + 2*x^7 + 3*x^8 + 3*x^9 + x^10 + x^11)/(1 - x^16) = (1 + 2*x^2 + 2*x^6 + x^8)/((1 - x)*(1 + x^4)*(1 + x^8)).
a(n) = A000505(n+5) mod 4. - John M. Campbell, Jul 14 2016
a(n) = A000506(n+6) mod 4. - John M. Campbell, Jul 15 2016

G.f. corrected by Bruno Berselli, Jul 19 2016

A133906 Least number m such that binomial(n+m, m) mod m = 1.

Original entry on oeis.org

2, 3, 5, 2, 2, 7, 9, 2, 2, 3, 3, 2, 2, 17, 17, 2, 2, 3, 3, 2, 2, 23, 25, 2, 2, 4, 3, 2, 2, 31, 37, 2, 2, 8, 8, 2, 2, 3, 41, 2, 2, 4, 4, 2, 2, 3, 3, 2, 2, 5, 5, 2, 2, 3, 3, 2, 2, 4, 4, 2, 2, 67, 3, 2, 2, 44, 44, 2, 2, 16, 16, 2, 2, 3, 4, 2, 2, 5, 5, 2, 2, 3, 3, 2, 2, 89, 9, 2, 2, 3, 3, 2, 2, 97, 97, 2, 2, 7

Offset: 1

Hieronymus Fischer, Oct 20 2007

nonn

			a(1)=2, since binomial(1+2, 2) mod 2 = 3 mod 2 = 1 and 2 is the minimal number with this property.
a(7)=9 because of binomial(7+9, 9) = 11440 = 1271*9 + 1, but binomial(7+k, k) mod k <> 1 for all numbers < 9.

Seiichi Manyama, Table of n, a(n) for n = 1..1000

Cf. A000040, A133620, A133621, A133623, A133630, A133635.

Cf. A133872, A133880, A133890, A133900, A133907, A133910.

Table[Block[{m = 1}, While[Mod[Binomial[n + m, m], m] != 1, m++]; m], {n, 98}] (* Michael De Vlieger, Jul 30 2018 *)

a(n) = {my(m = 1, ok = 0); until (ok, if (binomial(n+m, m) % m == 1, ok = 1, m++);); return (m);} \\ Michel Marcus, Jul 15 2013

A135121 Numbers such that the digital sum base 2 and the digital sum base 3 and the digital sum base 5 all are equal.

Original entry on oeis.org

0, 1, 6, 7, 10, 11, 60, 61, 180, 181, 285, 300, 301, 575, 687, 754, 826, 827, 882, 883, 900, 901, 910, 911, 1254, 1305, 1311, 1326, 1327, 1335, 1377, 1383, 1386, 1387, 1395, 1431, 1506, 1507, 1532, 1626, 1627, 1650, 1651, 1890, 1891, 1955, 2013, 2036, 2040

Offset: 1

Hieronymus Fischer, Dec 31 2007

			a(2)=6, since ds_2(6)=ds_3(6)=ds_5(6), where ds_x=digital sum base x.

Stanislav Sykora, Table of n, a(n) for n = 1..10000

Cf. A007953, A054899, A131451, A133620, A133900, A134599, A135100, A135110, A135120, A037308, A212222.

Select[Range[0,3000],Length[Union[Total/@IntegerDigits[#,{2,3,5}]]]==1&] (* Harvey P. Dale, Sep 04 2014 *)

Added 0, Stanislav Sykora, May 06 2012

cp's OEIS Frontend

A362689 Binomial(n+p, n) mod n where p=9.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Formula

A133882 a(n) = binomial(n+2,n) mod 2^2.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A133883 a(n) = binomial(n+3,n) mod 3^2.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

Extensions

A133886 a(n) = binomial(n+6,n) mod 6.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A078177 Composite numbers with an integer arithmetic mean of all prime factors.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A133873 n modulo 3 repeated 3 times.

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

A133874 n modulo 4 repeated 4 times.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Python

Formula

A133884 a(n) = binomial(n+4,n) mod 4.

Views

Author