Sequences
392,541 sequences
- Number of points in Z^5 of norm <= n.A055411
Number of points in Z^5 of norm <= n.
- Number of points in Z^6 of norm <= n.A055412
Number of points in Z^6 of norm <= n.
- Number of points in Z^7 of norm <= n.A055413
Number of points in Z^7 of norm <= n.
- Number of points in Z^8 of norm <= n.A055414
Number of points in Z^8 of norm <= n.
- Number of points in Z^9 of norm <= n.A055415
Number of points in Z^9 of norm <= n.
- Number of points in Z^10 of norm <= n.A055416
Number of points in Z^10 of norm <= n.
- Number of points in N^n of norm <= 2.A055417
Number of points in N^n of norm <= 2.
- Number of points in N^n of norm <= 3.A055418
Number of points in N^n of norm <= 3.
- Number of points in N^n of norm <= 4.A055419
Number of points in N^n of norm <= 4.
- Number of points in N^n of norm <= 5.A055420
Number of points in N^n of norm <= 5.
- Number of points in N^n of norm <= 6.A055421
Number of points in N^n of norm <= 6.
- Number of points in N^n of norm <= 7.A055422
Number of points in N^n of norm <= 7.
- Number of points in N^n of norm <= 8.A055423
Number of points in N^n of norm <= 8.
- Number of points in N^n of norm <= 9.A055424
Number of points in N^n of norm <= 9.
- Number of points in N^n of norm <= 10.A055425
Number of points in N^n of norm <= 10.
- Number of points in Z^n of norm <= 2.A055426
Number of points in Z^n of norm <= 2.
- Number of points in Z^n of norm <= 3.A055427
Number of points in Z^n of norm <= 3.
- Number of points in Z^n of norm <= 4.A055428
Number of points in Z^n of norm <= 4.
- Number of points in Z^n of norm <= 5.A055429
Number of points in Z^n of norm <= 5.
- Number of points in Z^n of norm <= 6.A055430
Number of points in Z^n of norm <= 6.
- Number of points in Z^n of norm <= 7.A055431
Number of points in Z^n of norm <= 7.
- Number of points in Z^n of norm <= 8.A055432
Number of points in Z^n of norm <= 8.
- Number of points in Z^n of norm <= 9.A055433
Number of points in Z^n of norm <= 9.
- Number of points in Z^n of norm <= 10.A055434
Number of points in Z^n of norm <= 10.
- (1/18)*Difference between concatenation of n and n^2 and concatenation of n^2 and n.A055435
(1/18)*Difference between concatenation of n and n^2 and concatenation of n^2 and n.
- a(n) = concatenation of n^2 and n.A055436
a(n) = concatenation of n^2 and n.
- a(n) = 10*n^2+n.A055437
a(n) = 10*n^2+n.
- a(n) = 100*n^2 + n.A055438
a(n) = 100*n^2 + n.
- Distribution of first digit of mantissa following Benford's Law, using Sainte-Lague method to minimize chi-squared statistic.A055439
Distribution of first digit of mantissa following Benford's Law, using Sainte-Lague method to minimize chi-squared statistic.
- Distribution of first digit of mantissa following Benford's Law, using d'Hondt method.A055440
Distribution of first digit of mantissa following Benford's Law, using d'Hondt method.
- Distribution of first digit of mantissa following Benford's Law, using largest remainder method with Hare quotas.A055441
Distribution of first digit of mantissa following Benford's Law, using largest remainder method with Hare quotas.
- Distribution of first digit of mantissa following Benford's Law, using largest remainder method with Droop quotas.A055442
Distribution of first digit of mantissa following Benford's Law, using largest remainder method with Droop quotas.
- Base 3 distribution of first digit of mantissa following Benford's Law, to minimize chi-squared statistic.A055443
Base 3 distribution of first digit of mantissa following Benford's Law, to minimize chi-squared statistic.
- Base 4 distribution of first digit of mantissa following Benford's Law, to minimize chi-squared statistic.A055444
Base 4 distribution of first digit of mantissa following Benford's Law, to minimize chi-squared statistic.
- Base 5 distribution of first digit of mantissa following Benford's Law, to minimize chi-squared statistic.A055445
Base 5 distribution of first digit of mantissa following Benford's Law, to minimize chi-squared statistic.
- Base 6 distribution of first digit of mantissa following Benford's Law, to minimize chi-squared statistic.A055446
Base 6 distribution of first digit of mantissa following Benford's Law, to minimize chi-squared statistic.
- Base 7 distribution of first digit of mantissa following Benford's Law, to minimize chi-squared statistic.A055447
Base 7 distribution of first digit of mantissa following Benford's Law, to minimize chi-squared statistic.
- Base 8 distribution of first digit of mantissa following Benford's Law, to minimize chi-squared statistic.A055448
Base 8 distribution of first digit of mantissa following Benford's Law, to minimize chi-squared statistic.
- Base 9 distribution of first digit of mantissa following Benford's Law, to minimize chi-squared statistic.A055449
Base 9 distribution of first digit of mantissa following Benford's Law, to minimize chi-squared statistic.
- Path-counting array T; each step of a path is (1 right) or (1 up) to a point below line y=x, else (1 right and 1 up) or (1 up) to a point on the line y=x, else (1 left) or (1 up) to a point above line y=x. T(i,j)=number of paths to point (i-j,j), for 1<=j<=i, i >= 1.A055450
Path-counting array T; each step of a path is (1 right) or (1 up) to a point below line y=x, else (1 right and 1 up) or (1 up) to a point on the line y=x, else (1 left) or (1 up) to a point above line y=x. T(i,j)=number of paths to point (i-j,j), for 1<=j<=i, i >= 1.
- Row sums of array in A055450.A055451
Row sums of array in A055450.
- a(n) = T(n,n-2), array T as in A055450.A055452
a(n) = T(n,n-2), array T as in A055450.
- a(n) = T(n,n-3), array T as in A055450.A055453
a(n) = T(n,n-3), array T as in A055450.
- a(n) = A055450(n, n-4).A055454
a(n) = A055450(n, n-4).
- a(n) = A055450(n, n-5).A055455
a(n) = A055450(n, n-5).
- a(n) is the smallest number which is not the sum of exactly 1 or of n earlier terms.A055456
a(n) is the smallest number which is not the sum of exactly 1 or of n earlier terms.
- 5^a(n) exactly divides 5n. Or, 5-adic valuation of 5n.A055457
5^a(n) exactly divides 5n. Or, 5-adic valuation of 5n.
- a(n) = smallest composite solution x to the equation phi(x+2n) = phi(x)+2n.A055458
a(n) = smallest composite solution x to the equation phi(x+2n) = phi(x)+2n.
- a(n) = number of permutations of {1,...,n} which are twice but not 3-times reformable.A055459
a(n) = number of permutations of {1,...,n} which are twice but not 3-times reformable.
- Number of primes with odd exponents in the prime power factorization of n!.A055460
Number of primes with odd exponents in the prime power factorization of n!.