Sequences
392,541 sequences
- Greatest k such that 3^k divides n!.A054861
Greatest k such that 3^k divides n!.
- (+2)-unitary sigma 3-multiple perfect number: numbers k such that (+2)usigma(k) = 3*k, where (+2)usigma(k) = A107759(k).A054862
(+2)-unitary sigma 3-multiple perfect number: numbers k such that (+2)usigma(k) = 3*k, where (+2)usigma(k) = A107759(k).
- Dice markers in the board game "The Settlers of Catan". There are a total of 18 markers, whose backs are assigned letters from A to R and whose fronts are assigned these numbers.A054863
Dice markers in the board game "The Settlers of Catan". There are a total of 18 markers, whose backs are assigned letters from A to R and whose fronts are assigned these numbers.
- Numbers not divisible by any of their digits when written in base 8.A054864
Numbers not divisible by any of their digits when written in base 8.
- Numbers not divisible by any of their digits when written in base 9.A054865
Numbers not divisible by any of their digits when written in base 9.
- Incrementally largest terms in the continued fraction for Khinchin's constant.A054866
Incrementally largest terms in the continued fraction for Khinchin's constant.
- Number of non-attacking configurations on a diamond of size n, where a prince attacks the four adjacent non-diagonal squares.A054867
Number of non-attacking configurations on a diamond of size n, where a prince attacks the four adjacent non-diagonal squares.
- Sum of bits of sum of bits of n: a(n) = wt(wt(n)).A054868
Sum of bits of sum of bits of n: a(n) = wt(wt(n)).
- Digits of an idempotent 6-adic number.A054869
Digits of an idempotent 6-adic number.
- Positions of the incrementally largest terms in the continued fraction for Khinchin's constant.A054870
Positions of the incrementally largest terms in the continued fraction for Khinchin's constant.
- a(n) = H_n(3,2) where H_n is the n-th hyperoperator.A054871
a(n) = H_n(3,2) where H_n is the n-th hyperoperator.
- Number of (12345, 13245, 21345, 23145, 31245, 32145)-avoiding permutations.A054872
Number of (12345, 13245, 21345, 23145, 31245, 32145)-avoiding permutations.
- Number of (S_5 67)-avoiding permutations.A054873
Number of (S_5 67)-avoiding permutations.
- a(n) = 2^(sum of a(i) where i<n).A054874
a(n) = 2^(sum of a(i) where i<n).
- Number of pairwise incongruent triangles with integer sides and positive integer area and longest side of length n.A054875
Number of pairwise incongruent triangles with integer sides and positive integer area and longest side of length n.
- Number of pairwise incongruent triangles with integer sides and positive integer area and second longest side of length n.A054876
Number of pairwise incongruent triangles with integer sides and positive integer area and second longest side of length n.
- Closed walks of length n along the edges of a pentagon based at a vertex.A054877
Closed walks of length n along the edges of a pentagon based at a vertex.
- Number of closed walks of length n along the edges of a tetrahedron based at a vertex.A054878
Number of closed walks of length n along the edges of a tetrahedron based at a vertex.
- Closed walks of length 2n along the edges of a cube based at a vertex.A054879
Closed walks of length 2n along the edges of a cube based at a vertex.
- a(n) = 3*(9^n - 1)/4.A054880
a(n) = 3*(9^n - 1)/4.
- Number of walks of length n along the edges of an octahedron starting and ending at a vertex and also ( with a(0)=0 ) between two opposite vertices.A054881
Number of walks of length n along the edges of an octahedron starting and ending at a vertex and also ( with a(0)=0 ) between two opposite vertices.
- Closed walks of length n along the edges of a dodecahedron based at a vertex.A054882
Closed walks of length n along the edges of a dodecahedron based at a vertex.
- Number of walks of length n along the edges of a dodecahedron between two opposite vertices.A054883
Number of walks of length n along the edges of a dodecahedron between two opposite vertices.
- Number of closed walks of length n along the edges of an icosahedron based at a vertex.A054884
Number of closed walks of length n along the edges of an icosahedron based at a vertex.
- Number of walks of length n along the edges of an icosahedron between two opposite vertices.A054885
Number of walks of length n along the edges of an icosahedron between two opposite vertices.
- Layer counting sequence for hyperbolic tessellation by cuspidal triangles of angles (Pi/3,Pi/3,0) (this is the classical modular tessellation).A054886
Layer counting sequence for hyperbolic tessellation by cuspidal triangles of angles (Pi/3,Pi/3,0) (this is the classical modular tessellation).
- Layer counting sequence for hyperbolic tessellation by cuspidal triangles of angles (Pi/3, Pi/5, Pi/7).A054887
Layer counting sequence for hyperbolic tessellation by cuspidal triangles of angles (Pi/3, Pi/5, Pi/7).
- Layer counting sequence for hyperbolic tessellation by regular pentagons of angle Pi/2.A054888
Layer counting sequence for hyperbolic tessellation by regular pentagons of angle Pi/2.
- Layer counting sequence for hyperbolic tessellation by regular pentagons of angle 2*Pi/5.A054889
Layer counting sequence for hyperbolic tessellation by regular pentagons of angle 2*Pi/5.
- Layer counting sequence for hyperbolic tessellation by regular heptagons of angle Pi/3.A054890
Layer counting sequence for hyperbolic tessellation by regular heptagons of angle Pi/3.
- Cusp form of weight 13/2 associated to the unique cusp form of weight 12 under Shimura correspondence.A054891
Cusp form of weight 13/2 associated to the unique cusp form of weight 12 under Shimura correspondence.
- Smallest prime a(n) such that the sum of n consecutive primes starting with a(n) is divisible by n.A054892
Smallest prime a(n) such that the sum of n consecutive primes starting with a(n) is divisible by n.
- a(n) = Sum_{j > 0} floor(n/4^j).A054893
a(n) = Sum_{j > 0} floor(n/4^j).
- a(n+1) = 4*a(n) + 4*a(n-1) - 4*a(n-2) - a(n-3) with a(1)=1, a(2)=2, a(3)=11, a(4)=48.A054894
a(n+1) = 4*a(n) + 4*a(n-1) - 4*a(n-2) - a(n-3) with a(1)=1, a(2)=2, a(3)=11, a(4)=48.
- a(n) = Sum_{k>0} floor(n/6^k).A054895
a(n) = Sum_{k>0} floor(n/6^k).
- a(n) = Sum_{k>0} floor(n/7^k).A054896
a(n) = Sum_{k>0} floor(n/7^k).
- a(n) = Sum_{k>0} floor(n/8^k).A054897
a(n) = Sum_{k>0} floor(n/8^k).
- a(n) = Sum_{k>0} floor(n/9^k).A054898
a(n) = Sum_{k>0} floor(n/9^k).
- a(n) = Sum_{k>0} floor(n/10^k).A054899
a(n) = Sum_{k>0} floor(n/10^k).
- a(n) = Sum_{j >= 1} floor(n/16^j).A054900
a(n) = Sum_{j >= 1} floor(n/16^j).
- Numbers of the form 2^i*5^j where i+j is even.A054901
Numbers of the form 2^i*5^j where i+j is even.
- Composite numbers n such that sigma(n)+12 = sigma(n+12).A054902
Composite numbers n such that sigma(n)+12 = sigma(n+12).
- Composite numbers n such that sigma(n)+6 = sigma(n+6), where sigma=A000203.A054903
Composite numbers n such that sigma(n)+6 = sigma(n+6), where sigma=A000203.
- x = a(n) is the smallest composite number such that sigma(x+6n) = sigma(x)+6n, where sigma = A000203.A054904
x = a(n) is the smallest composite number such that sigma(x+6n) = sigma(x)+6n, where sigma = A000203.
- Smallest composite x such that sigma(x) + 2n = sigma(x + 2n).A054905
Smallest composite x such that sigma(x) + 2n = sigma(x + 2n).
- Smallest number x such that sigma(x+2n) = sigma(x)+2n (first definition).A054906
Smallest number x such that sigma(x+2n) = sigma(x)+2n (first definition).
- Number of n-dimensional unimodular lattices (or quadratic forms) containing no vectors of norm 1.A054907
Number of n-dimensional unimodular lattices (or quadratic forms) containing no vectors of norm 1.
- Number of n-dimensional odd unimodular lattices (or quadratic forms) containing no vectors of norm 1.A054908
Number of n-dimensional odd unimodular lattices (or quadratic forms) containing no vectors of norm 1.
- Number of 8n-dimensional even unimodular lattices (or quadratic forms).A054909
Number of 8n-dimensional even unimodular lattices (or quadratic forms).
- Palindromic heptagonal numbers.A054910
Palindromic heptagonal numbers.