Sequences
392,541 sequences
- Number of abstract dissection types of configurations of n points in 4 dimensions.A063861
Number of abstract dissection types of configurations of n points in 4 dimensions.
- Total number of abstract dissection types of configurations of n points in dimensions 2 through n.A063862
Total number of abstract dissection types of configurations of n points in dimensions 2 through n.
- Theta series of A15 packing with respect to origin.A063863
Theta series of A15 packing with respect to origin.
- Theta series of A15 packing with respect to point (0,1,2).A063864
Theta series of A15 packing with respect to point (0,1,2).
- Number of solutions to +- 1 +- 2 +- 3 +- ... +- n = 0.A063865
Number of solutions to +- 1 +- 2 +- 3 +- ... +- n = 0.
- Number of solutions to +- 1 +- 2 +- 3 +- ... +- n = 1.A063866
Number of solutions to +- 1 +- 2 +- 3 +- ... +- n = 1.
- Number of solutions to +- 1 +- 2 +- 3 +- ... +- n = 0 or +- 1.A063867
Number of solutions to +- 1 +- 2 +- 3 +- ... +- n = 0 or +- 1.
- Solutions to phi(x + omega(x)) = phi(x) + d(x), where phi() = A000010(), d() = A000005() and omega() = A001221().A063868
Solutions to phi(x + omega(x)) = phi(x) + d(x), where phi() = A000010(), d() = A000005() and omega() = A001221().
- Least k such that sigma(k)=m^n for some m>1.A063869
Least k such that sigma(k)=m^n for some m>1.
- Numbers n such that sigma(n) - usigma(n) = 3n/2.A063870
Numbers n such that sigma(n) - usigma(n) = 3n/2.
- Trajectory of 3 under map n->7n-1 if n odd, n->n/2 if n even.A063871
Trajectory of 3 under map n->7n-1 if n odd, n->n/2 if n even.
- Let m be the n-th positive integer such that phi(m) is divisible by m - phi(m). Then a(n) = phi(m)/(m - phi(m)).A063872
Let m be the n-th positive integer such that phi(m) is divisible by m - phi(m). Then a(n) = phi(m)/(m - phi(m)).
- Duplicate of A063131.A063873
Duplicate of A063131.
- Duplicate of A063132.A063874
Duplicate of A063132.
- Numbers k such that sigma(k) - usigma(k) > 3k.A063875
Numbers k such that sigma(k) - usigma(k) > 3k.
- Duplicate of A063156.A063876
Duplicate of A063156.
- Composite numbers not divisible by 7 which in base 7 contain their largest proper factor as a substring.A063877
Composite numbers not divisible by 7 which in base 7 contain their largest proper factor as a substring.
- Duplicate of A063167.A063878
Duplicate of A063167.
- Duplicate of A063172.A063879
Duplicate of A063172.
- Numbers k such that sigma(k) = 2*usigma(k).A063880
Numbers k such that sigma(k) = 2*usigma(k).
- Number of oriented trees rooted at an arc.A063881
Number of oriented trees rooted at an arc.
- a(n) = a(n - a(n - 1)) + a(n - a(n - 4)), with a(1) = ... = a(4) = 1.A063882
a(n) = a(n - a(n - 1)) + a(n - a(n - 4)), with a(1) = ... = a(4) = 1.
- Number of ways writing n as a sum of different Mersenne prime exponents (terms of A000043).A063883
Number of ways writing n as a sum of different Mersenne prime exponents (terms of A000043).
- a(1) = 2, a(2) = 3 and a(k+1) is the least prime not already chosen that divides some a(i)*a(j)+1, where 1<=i<=j<=k.A063884
a(1) = 2, a(2) = 3 and a(k+1) is the least prime not already chosen that divides some a(i)*a(j)+1, where 1<=i<=j<=k.
- z(sigma(n)) = 2n, where z(n) = A048146.A063885
z(sigma(n)) = 2n, where z(n) = A048146.
- Number of n-step walks on a line starting from the origin but not returning to it.A063886
Number of n-step walks on a line starting from the origin but not returning to it.
- Number of n-step walks on a square lattice starting from the origin but not returning to it at any stage.A063887
Number of n-step walks on a square lattice starting from the origin but not returning to it at any stage.
- Number of n-step walks on a cube lattice starting from the origin but not returning to it at any stage.A063888
Number of n-step walks on a cube lattice starting from the origin but not returning to it at any stage.
- Composite numbers not divisible by 5 which in base 5 contain their largest proper factor as a substring.A063889
Composite numbers not divisible by 5 which in base 5 contain their largest proper factor as a substring.
- Number of solutions to +- 1 +- 2 +- 3 +- ... +- n = n.A063890
Number of solutions to +- 1 +- 2 +- 3 +- ... +- n = n.
- Numbers k such that nusigma(usigma(k)) = 2k, where usigma(k) is the sum of unitary divisors of k (A034448) and nusigma(k) is the sum of non-unitary divisors of k (A048146).A063891
Numbers k such that nusigma(usigma(k)) = 2k, where usigma(k) is the sum of unitary divisors of k (A034448) and nusigma(k) is the sum of non-unitary divisors of k (A048146).
- a(1) = a(2) = a(3) = 1, a(n) = a(n-a(n-2))+a(n-a(n-3)) for n>3.A063892
a(1) = a(2) = a(3) = 1, a(n) = a(n-a(n-2))+a(n-a(n-3)) for n>3.
- Numbers k such that the sum of proper divisors or aliquot parts of k^2 is a square.A063893
Numbers k such that the sum of proper divisors or aliquot parts of k^2 is a square.
- Start with x, y; then concatenate each word in turn with all preceding words, getting x y xy xxy yxy xxxy yxxy xyxxy ...; sequence gives number of words of length n. Also binary trees by degree: x y (x,y) (x,(x,y)) (y,(x,y)) (x,(x,(x,y))) (y,(x,(x,y))) ((x,y),(x,(x,y)))...A063894
Start with x, y; then concatenate each word in turn with all preceding words, getting x y xy xxy yxy xxxy yxxy xyxxy ...; sequence gives number of words of length n. Also binary trees by degree: x y (x,y) (x,(x,y)) (y,(x,y)) (x,(x,(x,y))) (y,(x,(x,y))) ((x,y),(x,(x,y)))...
- Start with x, xy; then concatenate each word in turn with all preceding words, getting x xy xxy xxxy xyxxy xxxxy xyxxxy xxyxxxy ...; sequence gives number of words of length n. Also binary trees by degree: x (x,y) (x,(x,y)) (x,(x,(x,y))) ((x,y),(x,(x,y)))...A063895
Start with x, xy; then concatenate each word in turn with all preceding words, getting x xy xxy xxxy xyxxy xxxxy xyxxxy xxyxxxy ...; sequence gives number of words of length n. Also binary trees by degree: x (x,y) (x,(x,y)) (x,(x,(x,y))) ((x,y),(x,(x,y)))...
- a(n) = 2^Fibonacci(n) - 1.A063896
a(n) = 2^Fibonacci(n) - 1.
- a(n) is the least k such that k - A000215(j), j=0..n, are all primes.A063897
a(n) is the least k such that k - A000215(j), j=0..n, are all primes.
- Smallest k > 0 such that k + F_n are all primes, where F_n is the n-th Fermat number.A063898
Smallest k > 0 such that k + F_n are all primes, where F_n is the n-th Fermat number.
- Duplicate of A006889.A063899
Duplicate of A006889.
- Numbers k such that sum of proper divisors or aliquot parts of k^2 (excluding 1) is a square, or A048050(k^2) is a square.A063900
Numbers k such that sum of proper divisors or aliquot parts of k^2 (excluding 1) is a square, or A048050(k^2) is a square.
- Numbers k such that Sum_{j=1..k} A001065(j) is divisible by k.A063901
Numbers k such that Sum_{j=1..k} A001065(j) is divisible by k.
- a(n+1) = sum{j = 0,...n}[C(2n,2j)a(j)a(n-j)] with a(0) = 1.A063902
a(n+1) = sum{j = 0,...n}[C(2n,2j)a(j)a(n-j)] with a(0) = 1.
- Numbers k such that ud(k)*phi(k) = sigma(k), ud(k) = A034444.A063903
Numbers k such that ud(k)*phi(k) = sigma(k), ud(k) = A034444.
- a(1) = 2, a(2) = 3 and a(k+1) is the least prime not already chosen that divides some a(i)*a(j)+1, where 1<=i<j<=k.A063904
a(1) = 2, a(2) = 3 and a(k+1) is the least prime not already chosen that divides some a(i)*a(j)+1, where 1<=i<j<=k.
- Each prime p appears p times.A063905
Each prime p appears p times.
- Numbers m such that m = 2*sigma(m)/3 - 1.A063906
Numbers m such that m = 2*sigma(m)/3 - 1.
- Lesser of twin numbers (differing by 1) of the form F(i)^2 + F(j)^3 (A045704), where F() are Fibonacci numbers.A063907
Lesser of twin numbers (differing by 1) of the form F(i)^2 + F(j)^3 (A045704), where F() are Fibonacci numbers.
- Numbers k such that k and 2*k-3 are primes.A063908
Numbers k such that k and 2*k-3 are primes.
- Primes p such that 2*p - 5 is also prime.A063909
Primes p such that 2*p - 5 is also prime.
- Primes p such that 2*p - 7 is also prime.A063910
Primes p such that 2*p - 7 is also prime.