Sequences
392,541 sequences
- Number of cyclic subgroups of order 8 of general affine group AGL(n,2).A063411
Number of cyclic subgroups of order 8 of general affine group AGL(n,2).
- Number of cyclic subgroups of order 9 of general affine group AGL(n,2).A063412
Number of cyclic subgroups of order 9 of general affine group AGL(n,2).
- Number of cyclic subgroups of order 10 of general affine group AGL(n,2).A063413
Number of cyclic subgroups of order 10 of general affine group AGL(n,2).
- Number of digits in prime(n)! (A039716).A063414
Number of digits in prime(n)! (A039716).
- Triangle of coefficients of di-Boustrophedon transform (see A063179) read by rows: Let the original sequence be (U0,U1,...) and the transformed sequence (V0,V2,...), then Vn is a linear combination of U0,...,Un. T(n,m) is the coefficient that goes with Um to get Vn.A063415
Triangle of coefficients of di-Boustrophedon transform (see A063179) read by rows: Let the original sequence be (U0,U1,...) and the transformed sequence (V0,V2,...), then Vn is a linear combination of U0,...,Un. T(n,m) is the coefficient that goes with Um to get Vn.
- Multiples of 7 whose sum of digits is equal to 7.A063416
Multiples of 7 whose sum of digits is equal to 7.
- Ninth column (k=8) of septinomial array A063265.A063417
Ninth column (k=8) of septinomial array A063265.
- Tenth column (k=9) of septinomial array A063265.A063418
Tenth column (k=9) of septinomial array A063265.
- Central sextinomial coefficients.A063419
Central sextinomial coefficients.
- Coefficient array for certain numerator polynomials N3(n,x), n >= 0 (rising powers of x) used for trinomials.A063420
Coefficient array for certain numerator polynomials N3(n,x), n >= 0 (rising powers of x) used for trinomials.
- Coefficient array for certain numerator polynomials N4(n,x), n >= 0 (rising powers of x) used for quadrinomials.A063421
Coefficient array for certain numerator polynomials N4(n,x), n >= 0 (rising powers of x) used for quadrinomials.
- Coefficient array for certain numerator polynomials N5(n,x), n >= 0 (rising powers of x) used for quintinomials (also called pentanomials).A063422
Coefficient array for certain numerator polynomials N5(n,x), n >= 0 (rising powers of x) used for quintinomials (also called pentanomials).
- a(1) = 9, a(n) = concatenation of two closest factors of a(n-1) whose product equals a(n-1) or if a(n-1) is a prime then the concatenation of 1 and a(n-1).A063423
a(1) = 9, a(n) = concatenation of two closest factors of a(n-1) whose product equals a(n-1) or if a(n-1) is a prime then the concatenation of 1 and a(n-1).
- a(1) = 10, a(n) = concatenation of two closest factors of a(n-1) whose product equals a(n-1) or if a(n-1) is a prime then the concatenation of 1 and a(n-1).A063424
a(1) = 10, a(n) = concatenation of two closest factors of a(n-1) whose product equals a(n-1) or if a(n-1) is a prime then the concatenation of 1 and a(n-1).
- Unattainable numbers: integers not expressible as k + product of nonzero digits of k (A063114).A063425
Unattainable numbers: integers not expressible as k + product of nonzero digits of k (A063114).
- Smallest k such that 2^k has exactly n 2's in its decimal representation.A063426
Smallest k such that 2^k has exactly n 2's in its decimal representation.
- a(n) is the smallest positive integer k such that n*k/(n+k) is an integer.A063427
a(n) is the smallest positive integer k such that n*k/(n+k) is an integer.
- a(n) is the smallest positive integer of the form n*k/(n+k).A063428
a(n) is the smallest positive integer of the form n*k/(n+k).
- Smallest k such that 2^k has exactly n 3's in its decimal representation.A063429
Smallest k such that 2^k has exactly n 3's in its decimal representation.
- Smallest k such that 2^k has exactly n 4's in its decimal representation.A063430
Smallest k such that 2^k has exactly n 4's in its decimal representation.
- Square array read by antidiagonals of n written in base k (n,k>0).A063431
Square array read by antidiagonals of n written in base k (n,k>0).
- Triangle read by rows in which k-th entry in row n is representation of n in base k, for 1 <= k <= n.A063432
Triangle read by rows in which k-th entry in row n is representation of n in base k, for 1 <= k <= n.
- 'Reverse and Add!' trajectory of 10577.A063433
'Reverse and Add!' trajectory of 10577.
- Integers k > 10577 such that the 'Reverse and Add!' trajectory of k joins the trajectory of 10577.A063434
Integers k > 10577 such that the 'Reverse and Add!' trajectory of k joins the trajectory of 10577.
- Number of 'Reverse and Add!' operations that have to be applied to the n-th term of A063434 in order to obtain a term in the trajectory of 10577.A063435
Number of 'Reverse and Add!' operations that have to be applied to the n-th term of A063434 in order to obtain a term in the trajectory of 10577.
- Write 1, 2, 3, 4, ... counterclockwise in a hexagonal spiral around 0 starting left down, then a(n) is the sequence found by reading from 0 in the vertical upward direction.A063436
Write 1, 2, 3, 4, ... counterclockwise in a hexagonal spiral around 0 starting left down, then a(n) is the sequence found by reading from 0 in the vertical upward direction.
- Cardinality of largest critical set in any Latin square of order n.A063437
Cardinality of largest critical set in any Latin square of order n.
- a(n) = floor((n+1)*Pi) - floor(n*Pi).A063438
a(n) = floor((n+1)*Pi) - floor(n*Pi).
- a(n) = phi(n)^phi(n).A063439
a(n) = phi(n)^phi(n).
- Number of divisors of n-th triangular number.A063440
Number of divisors of n-th triangular number.
- a(n) = sigma(n) * mu(n).A063441
a(n) = sigma(n) * mu(n).
- Primes of the form p*q+4 where p and q are consecutive primes.A063442
Primes of the form p*q+4 where p and q are consecutive primes.
- Number of ways to tile an n X n square with 1 X 1 and 2 X 2 tiles.A063443
Number of ways to tile an n X n square with 1 X 1 and 2 X 2 tiles.
- Smallest number such that GCD of EulerPhi of 2 consecutive integer equals 2n.A063444
Smallest number such that GCD of EulerPhi of 2 consecutive integer equals 2n.
- Moebius transform of f(x) = EulerPhi(x^2) function (A002618).A063445
Moebius transform of f(x) = EulerPhi(x^2) function (A002618).
- Integers m such that d(m+1) = 2*d(m), where d(m) = A000005(m).A063446
Integers m such that d(m+1) = 2*d(m), where d(m) = A000005(m).
- Continued fraction for Pi * sqrt(2).A063447
Continued fraction for Pi * sqrt(2).
- Decimal expansion of Pi * sqrt(2).A063448
Decimal expansion of Pi * sqrt(2).
- Numbers k for which d(k+1) > 2*d(k), where d(j) = A000005(j).A063449
Numbers k for which d(k+1) > 2*d(k), where d(j) = A000005(j).
- Numbers k such that d(k+1) < 2*d(k), where d() is the number of divisors function A000005.A063450
Numbers k such that d(k+1) < 2*d(k), where d() is the number of divisors function A000005.
- Numbers k such that k*sigma(k) - 1 is a prime.A063451
Numbers k such that k*sigma(k) - 1 is a prime.
- Numbers k such that k - mu(k) is prime.A063452
Numbers k such that k - mu(k) is prime.
- Multiplicative with a(p^e) = 1 - p^3.A063453
Multiplicative with a(p^e) = 1 - p^3.
- Number of solutions to x^3 + y^3 = z^3 mod n.A063454
Number of solutions to x^3 + y^3 = z^3 mod n.
- Numbers n such that n | 9^n + 7^n + 5^n + 3^n.A063455
Numbers n such that n | 9^n + 7^n + 5^n + 3^n.
- Integers of the form (9^k + 7^k + 5^k + 3^k) / k.A063456
Integers of the form (9^k + 7^k + 5^k + 3^k) / k.
- a(n) = floor(a(n-1)*(Pi-1)); a(1) = 1.A063457
a(n) = floor(a(n-1)*(Pi-1)); a(1) = 1.
- a(n) = floor(a(n-1)^(Pi-1)); a(1) = 2.A063458
a(n) = floor(a(n-1)^(Pi-1)); a(1) = 2.
- A Beatty sequence: a(n) = floor(n*(Pi - 1)).A063459
A Beatty sequence: a(n) = floor(n*(Pi - 1)).
- A Beatty sequence: a(n) = floor(n * (Pi-1)/(Pi-2)).A063460
A Beatty sequence: a(n) = floor(n * (Pi-1)/(Pi-2)).