Sequences
392,541 sequences
- Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 8 (most significant digit on right).A061961
Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 8 (most significant digit on right).
- Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 9 (most significant digit on right).A061962
Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 9 (most significant digit on right).
- Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 10 (most significant digit on right).A061963
Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 10 (most significant digit on right).
- Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 11 (most significant digit on right).A061964
Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 11 (most significant digit on right).
- Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 12 (most significant digit on right).A061965
Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 12 (most significant digit on right).
- Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 13 (most significant digit on right).A061966
Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 13 (most significant digit on right).
- Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 14 (most significant digit on right).A061967
Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 14 (most significant digit on right).
- Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 15 (most significant digit on right).A061968
Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 15 (most significant digit on right).
- Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 16 (most significant digit on right).A061969
Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 16 (most significant digit on right).
- Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 17 (most significant digit on right).A061970
Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 17 (most significant digit on right).
- Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 18 (most significant digit on right).A061971
Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 18 (most significant digit on right).
- Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 19 (most significant digit on right).A061972
Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 19 (most significant digit on right).
- Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 20 (most significant digit on right).A061973
Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 20 (most significant digit on right).
- Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 21 (most significant digit on right).A061974
Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 21 (most significant digit on right).
- Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 22 (most significant digit on right).A061975
Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 22 (most significant digit on right).
- Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 23 (most significant digit on right).A061976
Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 23 (most significant digit on right).
- Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 24 (most significant digit on right).A061977
Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 24 (most significant digit on right).
- Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 25 (most significant digit on right).A061978
Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 25 (most significant digit on right).
- Floor of arithmetic-geometric mean of n and prime(n).A061979
Floor of arithmetic-geometric mean of n and prime(n).
- Square array A(n,k) = A(n-1,k) + A(n-1, floor(k/2)) + A(n-1, floor(k/3)), with A(0,0) = 1, read by antidiagonals.A061980
Square array A(n,k) = A(n-1,k) + A(n-1, floor(k/2)) + A(n-1, floor(k/3)), with A(0,0) = 1, read by antidiagonals.
- a(n) = 3^n - 2*n - 1.A061981
a(n) = 3^n - 2*n - 1.
- a(n) = 3^n - (n+1)*(n+2)/2.A061982
a(n) = 3^n - (n+1)*(n+2)/2.
- a(n) = 3^n - (3*n^2 + n + 2)/2.A061983
a(n) = 3^n - (3*n^2 + n + 2)/2.
- a(n) = 1 + a([n/2]) + a([n/3]) with a(0) = 0.A061984
a(n) = 1 + a([n/2]) + a([n/3]) with a(0) = 0.
- Values which can occur in sequence b(k) = 1 + b(floor(k/2)) + b(floor(k/3)) with b(0) = 0, i.e., in A061984.A061985
Values which can occur in sequence b(k) = 1 + b(floor(k/2)) + b(floor(k/3)) with b(0) = 0, i.e., in A061984.
- Number of times n appears in sequence b(k) = 1 + b(floor(k/2)) + b(floor(k/3)) with b(0) = 0, i.e., in A061984.A061986
Number of times n appears in sequence b(k) = 1 + b(floor(k/2)) + b(floor(k/3)) with b(0) = 0, i.e., in A061984.
- Number of times n-th distinct value is repeated in sequence b(k) = 1 + b(floor(k/2)) + b(floor(k/3)) with b(0) = 0, i.e., in A061984; also number of times n-th distinct row is repeated in square array T(n,k) = T(n-1,k) + T(n-1,floor(k/2)) + T(n-1,floor(k/3)) with T(0,0) = 1, i.e., in A061980.A061987
Number of times n-th distinct value is repeated in sequence b(k) = 1 + b(floor(k/2)) + b(floor(k/3)) with b(0) = 0, i.e., in A061984; also number of times n-th distinct row is repeated in square array T(n,k) = T(n-1,k) + T(n-1,floor(k/2)) + T(n-1,floor(k/3)) with T(0,0) = 1, i.e., in A061980.
- Find smallest k such that k^n is a sum of n n-th powers, say k^n = T(n,1)^n + ... + T(n,n)^n. Sequence gives triangle of successive rows T(n,1), ..., T(n,n). T(n,1) = ... = T(n,n) = 0 indicates no solution exists.A061988
Find smallest k such that k^n is a sum of n n-th powers, say k^n = T(n,1)^n + ... + T(n,n)^n. Sequence gives triangle of successive rows T(n,1), ..., T(n,n). T(n,1) = ... = T(n,n) = 0 indicates no solution exists.
- Number of ways to place 3 nonattacking queens on a 3 X n board.A061989
Number of ways to place 3 nonattacking queens on a 3 X n board.
- Number of ways to place 4 nonattacking queens on a 4 X n board.A061990
Number of ways to place 4 nonattacking queens on a 4 X n board.
- Number of ways to place 5 nonattacking queens on a 5 X n board.A061991
Number of ways to place 5 nonattacking queens on a 5 X n board.
- Number of ways to place 6 nonattacking queens on a 6 X n board.A061992
Number of ways to place 6 nonattacking queens on a 6 X n board.
- Number of ways to place 7 nonattacking queens on a 7 X n board.A061993
Number of ways to place 7 nonattacking queens on a 7 X n board.
- Number of ways to place 4 nonattacking queens on an n X n board.A061994
Number of ways to place 4 nonattacking queens on an n X n board.
- Number of ways to place 2 nonattacking kings on an n X n board.A061995
Number of ways to place 2 nonattacking kings on an n X n board.
- Number of ways to place 3 nonattacking kings on an n X n board.A061996
Number of ways to place 3 nonattacking kings on an n X n board.
- Number of ways to place 4 nonattacking kings on an n X n board.A061997
Number of ways to place 4 nonattacking kings on an n X n board.
- Number of ways to place 5 nonattacking kings on an n X n board.A061998
Number of ways to place 5 nonattacking kings on an n X n board.
- a(n) = 2*a(n-1)^2 - 2*a(n-2)^2 with a(0) = 0, a(1) = 1.A061999
a(n) = 2*a(n-1)^2 - 2*a(n-2)^2 with a(0) = 0, a(1) = 1.
- a(n) = a(n-1)^2 - a(n-2)^2 with a(0) = 0, a(1) = 2.A062000
a(n) = a(n-1)^2 - a(n-2)^2 with a(0) = 0, a(1) = 2.
- Table by antidiagonals of n-Stohr sequences: T(n,k) is least positive integer not the sum of at most n distinct terms in the n-th row from T(n,1) through to T(n,k-1).A062001
Table by antidiagonals of n-Stohr sequences: T(n,k) is least positive integer not the sum of at most n distinct terms in the n-th row from T(n,1) through to T(n,k-1).
- Gamma_0(n) has genus 0 and does not contain any elliptic elements.A062002
Gamma_0(n) has genus 0 and does not contain any elliptic elements.
- Product of the k numbers formed by cyclically permuting digits of n (where k = number of digits of n).A062003
Product of the k numbers formed by cyclically permuting digits of n (where k = number of digits of n).
- a(n) = 2*n*mu(n).A062004
a(n) = 2*n*mu(n).
- Floor of arithmetic-geometric mean of n and 2n.A062005
Floor of arithmetic-geometric mean of n and 2n.
- a(n) = prime(n)^n + 1.A062006
a(n) = prime(n)^n + 1.
- a(n) = mu(n)*prime(n).A062007
a(n) = mu(n)*prime(n).
- Number of divisors of (n!)!, or A000197.A062008
Number of divisors of (n!)!, or A000197.
- a(n) = floor(Sum_{k=1..n} sqrt(prime(k))).A062009
a(n) = floor(Sum_{k=1..n} sqrt(prime(k))).
- Let n = Sum_i d_i*10^i (0 <= d_i <= 9) be the decimal expansion of n. Then n is in the sequence if Sum_i d_i*b^i divides n for some base b >= 2 in the range max d_i < b < 10.A062010
Let n = Sum_i d_i*10^i (0 <= d_i <= 9) be the decimal expansion of n. Then n is in the sequence if Sum_i d_i*b^i divides n for some base b >= 2 in the range max d_i < b < 10.