Sequences
392,541 sequences
- Hexagonal excess: smallest amount by which n exceeds a hexagonal number (2k^2-k, A000384).A060511
Hexagonal excess: smallest amount by which n exceeds a hexagonal number (2k^2-k, A000384).
- Number of units of time making up the next larger unit: seconds, minutes, hours, days, weeks, years, centuries, millennia.A060512
Number of units of time making up the next larger unit: seconds, minutes, hours, days, weeks, years, centuries, millennia.
- Number of units of time making up the next larger unit: seconds, minutes, hours, days, years, centuries, millennia.A060513
Number of units of time making up the next larger unit: seconds, minutes, hours, days, years, centuries, millennia.
- Triangle T(n,k) of series-reduced (or homeomorphically irreducible) labeled graphs with n nodes and k edges, k=0..binomial(n,2).A060514
Triangle T(n,k) of series-reduced (or homeomorphically irreducible) labeled graphs with n nodes and k edges, k=0..binomial(n,2).
- Integers i > 1 for which there is no prime p such that i is a solution mod p of x^2 = 2.A060515
Integers i > 1 for which there is no prime p such that i is a solution mod p of x^2 = 2.
- Number of series-reduced (or homeomorphically irreducible) graphs with loops on n labeled nodes.A060516
Number of series-reduced (or homeomorphically irreducible) graphs with loops on n labeled nodes.
- Triangle T(n,k) of series-reduced (or homeomorphically irreducible) graphs with loops on n labeled nodes and with k edges, k=0..binomial(n+1,2).A060517
Triangle T(n,k) of series-reduced (or homeomorphically irreducible) graphs with loops on n labeled nodes and with k edges, k=0..binomial(n+1,2).
- Primes p that have exactly two primitive roots that are not primitive roots mod p^2.A060518
Primes p that have exactly two primitive roots that are not primitive roots mod p^2.
- Primes p that have exactly three primitive roots that are not primitive roots mod p^2.A060519
Primes p that have exactly three primitive roots that are not primitive roots mod p^2.
- Primes p that have at least four primitive roots that are not primitive roots mod p^2.A060520
Primes p that have at least four primitive roots that are not primitive roots mod p^2.
- Number of 3 X n grids of black and white cells, no 3 of same color vertically or horizontally contiguous.A060521
Number of 3 X n grids of black and white cells, no 3 of same color vertically or horizontally contiguous.
- Number of 4 X n grids of black and white cells, no 3 of same color vertically or horizontally contiguous.A060522
Number of 4 X n grids of black and white cells, no 3 of same color vertically or horizontally contiguous.
- Triangle T(n,k) = number of degree-n permutations with k even cycles, k=0..n.A060523
Triangle T(n,k) = number of degree-n permutations with k even cycles, k=0..n.
- Triangle read by rows: T(n,k) = number of degree-n permutations with k odd cycles, k=0..n, n >= 0.A060524
Triangle read by rows: T(n,k) = number of degree-n permutations with k odd cycles, k=0..n, n >= 0.
- A list of equal temperaments (equal divisions of the octave) whose nearest scale steps are closer and closer approximations to four of the simple ratios of musical harmony: 5/4, 4/3, 3/2 and 8/5.A060525
A list of equal temperaments (equal divisions of the octave) whose nearest scale steps are closer and closer approximations to four of the simple ratios of musical harmony: 5/4, 4/3, 3/2 and 8/5.
- A list of equal temperaments (equal divisions of the octave) whose nearest scale steps are closer and closer approximations to the ratios of six simple musical tones: 8/7 5/4 4/3 3/2 8/5 7/4.A060526
A list of equal temperaments (equal divisions of the octave) whose nearest scale steps are closer and closer approximations to the ratios of six simple musical tones: 8/7 5/4 4/3 3/2 8/5 7/4.
- A list of equal temperaments (equal divisions of the octave) whose nearest scale steps are closer and closer approximations to the ratios of 8 musical tones: 8/7 16/11 5/4 4/3 3/2 8/5 11/8 7/4.A060527
A list of equal temperaments (equal divisions of the octave) whose nearest scale steps are closer and closer approximations to the ratios of 8 musical tones: 8/7 16/11 5/4 4/3 3/2 8/5 11/8 7/4.
- A list of equal temperaments (equal divisions of the octave) whose nearest scale steps are closer and closer approximations to the ratios of two tones of musical harmony: the perfect 4th, 4/3 and its complement the perfect 5th, 3/2.A060528
A list of equal temperaments (equal divisions of the octave) whose nearest scale steps are closer and closer approximations to the ratios of two tones of musical harmony: the perfect 4th, 4/3 and its complement the perfect 5th, 3/2.
- A list of equal temperaments (equal divisions of the octave) whose nearest scale steps are closer and closer approximations to the ratios of three complementary pairs of simple musical tones: 7/6 and 12/7, 6/5 and 5/3 and 7/5 and 10/7.A060529
A list of equal temperaments (equal divisions of the octave) whose nearest scale steps are closer and closer approximations to the ratios of three complementary pairs of simple musical tones: 7/6 and 12/7, 6/5 and 5/3 and 7/5 and 10/7.
- Number of inequivalent ways to color edges of a cube using at most n colors.A060530
Number of inequivalent ways to color edges of a cube using at most n colors.
- 9th binomial transform of (1,0,1,0,1,...), A059841.A060531
9th binomial transform of (1,0,1,0,1,...), A059841.
- Number of ways to color vertices of a heptagon using <= n colors, allowing rotations and reflections.A060532
Number of ways to color vertices of a heptagon using <= n colors, allowing rotations and reflections.
- Number of homeomorphically irreducible multigraphs (or series-reduced multigraphs or multigraphs without nodes of degree 2) on 3 labeled nodes.A060533
Number of homeomorphically irreducible multigraphs (or series-reduced multigraphs or multigraphs without nodes of degree 2) on 3 labeled nodes.
- Number of homeomorphically irreducible multigraphs (or series-reduced multigraphs or multigraphs without nodes of degree 2) on 4 labeled nodes.A060534
Number of homeomorphically irreducible multigraphs (or series-reduced multigraphs or multigraphs without nodes of degree 2) on 4 labeled nodes.
- Number of homeomorphically irreducible multigraphs (or series-reduced multigraphs or multigraphs without nodes of degree 2) on 5 labeled nodes.A060535
Number of homeomorphically irreducible multigraphs (or series-reduced multigraphs or multigraphs without nodes of degree 2) on 5 labeled nodes.
- Number of homeomorphically irreducible multigraphs (or series-reduced multigraphs or multigraphs without nodes of degree 2) on 6 labeled nodes.A060536
Number of homeomorphically irreducible multigraphs (or series-reduced multigraphs or multigraphs without nodes of degree 2) on 6 labeled nodes.
- Number of homeomorphically irreducible multigraphs (or series-reduced multigraphs or multigraphs without nodes of degree 2) on 7 labeled nodes.A060537
Number of homeomorphically irreducible multigraphs (or series-reduced multigraphs or multigraphs without nodes of degree 2) on 7 labeled nodes.
- Square array read by antidiagonals of number of ways of dividing n*k labeled items into n labeled boxes with k items in each box.A060538
Square array read by antidiagonals of number of ways of dividing n*k labeled items into n labeled boxes with k items in each box.
- Table by antidiagonals of number of ways of choosing k items from n*k.A060539
Table by antidiagonals of number of ways of choosing k items from n*k.
- Square array read by antidiagonals downwards: T(n,k) = (n*k)!/(k!^n*n!), (n>=1, k>=1), the number of ways of dividing nk labeled items into n unlabeled boxes with k items in each box.A060540
Square array read by antidiagonals downwards: T(n,k) = (n*k)!/(k!^n*n!), (n>=1, k>=1), the number of ways of dividing nk labeled items into n unlabeled boxes with k items in each box.
- a(n) = binomial(4*n,4).A060541
a(n) = binomial(4*n,4).
- a(n) = (1/6)*multinomial(3*n;n,n,n).A060542
a(n) = (1/6)*multinomial(3*n;n,n,n).
- Triangle, read by antidiagonals, where T(n,k) = C(n+n*k+k, n*k+k).A060543
Triangle, read by antidiagonals, where T(n,k) = C(n+n*k+k, n*k+k).
- Centered 9-gonal (also known as nonagonal or enneagonal) numbers. Every third triangular number, starting with a(1)=1.A060544
Centered 9-gonal (also known as nonagonal or enneagonal) numbers. Every third triangular number, starting with a(1)=1.
- a(n) = binomial(n^2, n)/n.A060545
a(n) = binomial(n^2, n)/n.
- a(n) = 2^ceiling(n/2).A060546
a(n) = 2^ceiling(n/2).
- a(n) = 2^(floor(n/3) + ((n mod 3) mod 2)).A060547
a(n) = 2^(floor(n/3) + ((n mod 3) mod 2)).
- a(n) is the number of D3-symmetric patterns that may be formed with a top-down equilateral triangular arrangement of closely packed black and white cells satisfying the local matching rule of Pascal's triangle modulo 2, where n is the number of cells in each edge of the arrangement. The matching rule is such that any elementary top-down triangle of three neighboring cells in the arrangement contains either one or three white cells.A060548
a(n) is the number of D3-symmetric patterns that may be formed with a top-down equilateral triangular arrangement of closely packed black and white cells satisfying the local matching rule of Pascal's triangle modulo 2, where n is the number of cells in each edge of the arrangement. The matching rule is such that any elementary top-down triangle of three neighboring cells in the arrangement contains either one or three white cells.
- a(n) is the number of distinct patterns (modulo geometric D3-operations) with strict median-reflective (palindrome) symmetry (i.e., having no other symmetry) which can be formed by an equilateral triangular arrangement of closely packed black and white cells satisfying the local matching rule of Pascal's triangle modulo 2, where n is the number of cells in each edge of the arrangement. The matching rule is such that any elementary top-down triangle of three neighboring cells in the arrangement contains either one or three white cells.A060549
a(n) is the number of distinct patterns (modulo geometric D3-operations) with strict median-reflective (palindrome) symmetry (i.e., having no other symmetry) which can be formed by an equilateral triangular arrangement of closely packed black and white cells satisfying the local matching rule of Pascal's triangle modulo 2, where n is the number of cells in each edge of the arrangement. The matching rule is such that any elementary top-down triangle of three neighboring cells in the arrangement contains either one or three white cells.
- a(n) is the number of distinct patterns (modulo geometric D_3-operations) with no other than strict 120-degree rotational symmetry which can be formed by an equilateral triangular arrangement of closely packed black and white cells satisfying the local matching rule of Pascal's triangle modulo 2, where n is the number of cells in each edge of the arrangement.A060550
a(n) is the number of distinct patterns (modulo geometric D_3-operations) with no other than strict 120-degree rotational symmetry which can be formed by an equilateral triangular arrangement of closely packed black and white cells satisfying the local matching rule of Pascal's triangle modulo 2, where n is the number of cells in each edge of the arrangement.
- a(n) is the number of nonsymmetric patterns (no reflective, nor rotational symmetry) which may be formed by an equilateral triangular arrangement of closely packed black and white cells satisfying the local matching rule of Pascal's triangle modulo 2, where n is the number of cells in each edge of the arrangement. The matching rule is such that any elementary top-down triangle of three neighboring cells in the arrangement contains either one or three white cells.A060551
a(n) is the number of nonsymmetric patterns (no reflective, nor rotational symmetry) which may be formed by an equilateral triangular arrangement of closely packed black and white cells satisfying the local matching rule of Pascal's triangle modulo 2, where n is the number of cells in each edge of the arrangement. The matching rule is such that any elementary top-down triangle of three neighboring cells in the arrangement contains either one or three white cells.
- a(n) is the number of distinct (modulo geometric D3-operations) nonsymmetric (no reflective nor rotational symmetry) patterns which can be formed by an equilateral triangular arrangement of closely packed black and white cells satisfying the local matching rule of Pascal's triangle modulo 2, where n is the number of cells in each edge of the arrangement. The matching rule is such that any elementary top-down triangle of three neighboring cells in the arrangement contains either one or three white cells.A060552
a(n) is the number of distinct (modulo geometric D3-operations) nonsymmetric (no reflective nor rotational symmetry) patterns which can be formed by an equilateral triangular arrangement of closely packed black and white cells satisfying the local matching rule of Pascal's triangle modulo 2, where n is the number of cells in each edge of the arrangement. The matching rule is such that any elementary top-down triangle of three neighboring cells in the arrangement contains either one or three white cells.
- a(n) is the number of distinct (modulo geometric D3-operations) patterns which can be formed by an equilateral triangular arrangement of closely packed black and white cells satisfying the local matching rule of Pascal's triangle modulo 2, where n is the number of cells in each edge of the arrangement. The matching rule is such that any elementary top-down triangle of three neighboring cells in the arrangement contains either one or three white cells.A060553
a(n) is the number of distinct (modulo geometric D3-operations) patterns which can be formed by an equilateral triangular arrangement of closely packed black and white cells satisfying the local matching rule of Pascal's triangle modulo 2, where n is the number of cells in each edge of the arrangement. The matching rule is such that any elementary top-down triangle of three neighboring cells in the arrangement contains either one or three white cells.
- String together the first n numbers in an order which maximizes the result.A060554
String together the first n numbers in an order which maximizes the result.
- String together the first n numbers in an order which minimizes the result.A060555
String together the first n numbers in an order which minimizes the result.
- Bisection of triangle A060098: odd-indexed members of column sequences of A060098 (not counting leading zeros).A060556
Bisection of triangle A060098: odd-indexed members of column sequences of A060098 (not counting leading zeros).
- Row sums of triangle A060556.A060557
Row sums of triangle A060556.
- Fifth column (m=4) of triangle A060556.A060558
Fifth column (m=4) of triangle A060556.
- One half of sixth column (m=5) of triangle A060556.A060559
One half of sixth column (m=5) of triangle A060556.
- Number of ways to color the vertices of an octagon using <= n colors, allowing rotations and reflections.A060560
Number of ways to color the vertices of an octagon using <= n colors, allowing rotations and reflections.