Sequences
392,541 sequences
- Number of distinct resistances that can be produced from a circuit of n equal resistors using only series and parallel combinations.A048211
Number of distinct resistances that can be produced from a circuit of n equal resistors using only series and parallel combinations.
- Triangular array T read by rows: T(i,j)=b(i+1)-b(i+1-j); j=1,2,...,i; i=1,2,3,...; b=A004979.A048212
Triangular array T read by rows: T(i,j)=b(i+1)-b(i+1-j); j=1,2,...,i; i=1,2,3,...; b=A004979.
- a(n)=T(n,1), array T given by A048212.A048213
a(n)=T(n,1), array T given by A048212.
- a(n)=T(n,2), array T given by A048212.A048214
a(n)=T(n,2), array T given by A048212.
- a(n)=T(n,3), array T given by A048212.A048215
a(n)=T(n,3), array T given by A048212.
- a(n) = T(n,n), where array T is given by A048212.A048216
a(n) = T(n,n), where array T is given by A048212.
- a(n)=T(n+1,n), array T given by A048212.A048217
a(n)=T(n+1,n), array T given by A048212.
- a(n)=T(n+2,n), array T given by A048212.A048218
a(n)=T(n+2,n), array T given by A048212.
- a(n)=least m such that row m of T contains n, array T given by A048212.A048219
a(n)=least m such that row m of T contains n, array T given by A048212.
- a(n)=least m such that column m of T contains n, array T given by A048212.A048220
a(n)=least m such that column m of T contains n, array T given by A048212.
- a(n)=T(2n-1,n), array T given by A048212.A048221
a(n)=T(2n-1,n), array T given by A048212.
- a(n)=Sum{T(n,j): j=1,2,...,n}, array T given by A048212.A048222
a(n)=Sum{T(n,j): j=1,2,...,n}, array T given by A048212.
- a(n)=T(n,1)+T(n,n), array T given by A048212.A048223
a(n)=T(n,1)+T(n,n), array T given by A048212.
- a(n)=least number m such that m-a(n-1)<>a(j)-a(k) for all j,k less than m; a(1)=1, a(2)=4.A048224
a(n)=least number m such that m-a(n-1)<>a(j)-a(k) for all j,k less than m; a(1)=1, a(2)=4.
- Triangular array T read by rows: T(i,j)=b(i+1)-b(i+1-j); j=1,2,...,i; i=1,2,3,...; b=A048224.A048225
Triangular array T read by rows: T(i,j)=b(i+1)-b(i+1-j); j=1,2,...,i; i=1,2,3,...; b=A048224.
- a(n)=T(n,1), array T given by A048225.A048226
a(n)=T(n,1), array T given by A048225.
- a(n)=T(n,2), array T given by A048225.A048227
a(n)=T(n,2), array T given by A048225.
- a(n)=T(n,3), array T given by A048225.A048228
a(n)=T(n,3), array T given by A048225.
- a(n)=T(n,n), array T given by A048225.A048229
a(n)=T(n,n), array T given by A048225.
- a(n)=T(n+1,n), array T given by A048225.A048230
a(n)=T(n+1,n), array T given by A048225.
- a(n)=T(n+2,n), array T given by A048225.A048231
a(n)=T(n+2,n), array T given by A048225.
- a(n) is the least m such that row m of T contains n, array T given by A048225.A048232
a(n) is the least m such that row m of T contains n, array T given by A048225.
- a(n)=least m such that column m of T contains n, array T given by A048225.A048233
a(n)=least m such that column m of T contains n, array T given by A048225.
- a(n) = T(2n-1,n), array T given by A048225.A048234
a(n) = T(2n-1,n), array T given by A048225.
- a(n)=Sum{T(n,j): j=1,2,...,n}, array T given by A048225.A048235
a(n)=Sum{T(n,j): j=1,2,...,n}, array T given by A048225.
- a(n)=T(n,1)+T(n,n), array T given by A048225.A048236
a(n)=T(n,1)+T(n,n), array T given by A048225.
- Duplicate of A048139.A048237
Duplicate of A048139.
- Duplicate of A048140.A048238
Duplicate of A048140.
- Duplicate of A000786.A048239
Duplicate of A000786.
- Number of new colors that can be mixed with n units of yellow, blue, red.A048240
Number of new colors that can be mixed with n units of yellow, blue, red.
- Number of colors that can be mixed with n >= 0 units of yellow, blue, red.A048241
Number of colors that can be mixed with n >= 0 units of yellow, blue, red.
- Numbers that are not the sum of two abundant numbers (not necessarily distinct).A048242
Numbers that are not the sum of two abundant numbers (not necessarily distinct).
- Number of non-unitary divisors of binomial(n, floor(n/2)).A048243
Number of non-unitary divisors of binomial(n, floor(n/2)).
- a(n) = A048106(A001405(n)).A048244
a(n) = A048106(A001405(n)).
- Number of distinct terminal tic-tac-toe positions after n plays, up to rotation and reflection.A048245
Number of distinct terminal tic-tac-toe positions after n plays, up to rotation and reflection.
- Number of distinct 3-colorings (X, O and blank) of 3 X 3 grid with floor((n+1)/2) X's, floor(n/2) O's and 9 - n blanks.A048246
Number of distinct 3-colorings (X, O and blank) of 3 X 3 grid with floor((n+1)/2) X's, floor(n/2) O's and 9 - n blanks.
- Every prime occurs to this power in some factorial.A048247
Every prime occurs to this power in some factorial.
- Possible traces of n-step walks on 1-D lattice, ignoring translations.A048248
Possible traces of n-step walks on 1-D lattice, ignoring translations.
- Number of distinct values produced from sums and products of n unity arguments.A048249
Number of distinct values produced from sums and products of n unity arguments.
- Sum of the squarefree divisors of n.A048250
Sum of the squarefree divisors of n.
- a(n) is the smallest number whose sum of divisors is 6^n.A048251
a(n) is the smallest number whose sum of divisors is 6^n.
- Largest number whose sum of divisors is 6^n.A048252
Largest number whose sum of divisors is 6^n.
- a(n) is the number of integers whose sum of divisors is 6^n.A048253
a(n) is the number of integers whose sum of divisors is 6^n.
- Numbers whose sum of divisors is 6^4 = 1296.A048254
Numbers whose sum of divisors is 6^4 = 1296.
- Integers whose sum of divisors is 6^5 = 7776.A048255
Integers whose sum of divisors is 6^5 = 7776.
- Numbers whose sum of divisors is 6^6 = 46656.A048256
Numbers whose sum of divisors is 6^6 = 46656.
- Integers whose sum of divisors is a 7th power.A048257
Integers whose sum of divisors is a 7th power.
- Integers whose sum of divisors is an 8th power.A048258
Integers whose sum of divisors is an 8th power.
- Number of distinct solutions to x + y + z = 0 (mod n), where two solutions are equivalent if one can be obtained from the other by multiplying by units in Z/nZ and permuting x,y,z.A048259
Number of distinct solutions to x + y + z = 0 (mod n), where two solutions are equivalent if one can be obtained from the other by multiplying by units in Z/nZ and permuting x,y,z.
- The sum of 2 (not necessarily distinct) abundant numbers.A048260
The sum of 2 (not necessarily distinct) abundant numbers.