Sequences
392,541 sequences
- Number of periodic palindromic structures of length n using exactly five different symbols.A056511
Number of periodic palindromic structures of length n using exactly five different symbols.
- Number of periodic palindromic structures of length n using exactly six different symbols.A056512
Number of periodic palindromic structures of length n using exactly six different symbols.
- Number of primitive (period n) periodic palindromic structures using a maximum of two different symbols.A056513
Number of primitive (period n) periodic palindromic structures using a maximum of two different symbols.
- Number of primitive (period n) periodic palindromic structures using a maximum of three different symbols.A056514
Number of primitive (period n) periodic palindromic structures using a maximum of three different symbols.
- Number of primitive (period n) periodic palindromic structures using a maximum of four different symbols.A056515
Number of primitive (period n) periodic palindromic structures using a maximum of four different symbols.
- Number of primitive (period n) periodic palindromic structures using a maximum of five different symbols.A056516
Number of primitive (period n) periodic palindromic structures using a maximum of five different symbols.
- Number of primitive (period n) periodic palindromic structures using a maximum of six different symbols.A056517
Number of primitive (period n) periodic palindromic structures using a maximum of six different symbols.
- Number of primitive (period n) periodic palindromic structures using exactly two different symbols.A056518
Number of primitive (period n) periodic palindromic structures using exactly two different symbols.
- Number of primitive (period n) periodic palindromic structures using exactly three different symbols.A056519
Number of primitive (period n) periodic palindromic structures using exactly three different symbols.
- a(n) = (n + 2)*(2*n^2 - n + 3)/6.A056520
a(n) = (n + 2)*(2*n^2 - n + 3)/6.
- Number of primitive (period n) periodic palindromic structures using exactly four different symbols.A056521
Number of primitive (period n) periodic palindromic structures using exactly four different symbols.
- Number of primitive (period n) periodic palindromic structures using exactly five different symbols.A056522
Number of primitive (period n) periodic palindromic structures using exactly five different symbols.
- Number of primitive (period n) periodic palindromic structures using exactly six different symbols.A056523
Number of primitive (period n) periodic palindromic structures using exactly six different symbols.
- Palindromes with even number of digits.A056524
Palindromes with even number of digits.
- Palindromes with odd number of digits.A056525
Palindromes with odd number of digits.
- First differences of Flavius Josephus's sieve.A056526
First differences of Flavius Josephus's sieve.
- Numbers where iterated sum of digits of square settles down to a cyclic pattern (in fact 13, 16, 13, 16, ...).A056527
Numbers where iterated sum of digits of square settles down to a cyclic pattern (in fact 13, 16, 13, 16, ...).
- Sum of digits of square of sum of digits of square.A056528
Sum of digits of square of sum of digits of square.
- Number of iterations of sum of digits of square to reach 1, 9, 13 or 16.A056529
Number of iterations of sum of digits of square to reach 1, 9, 13 or 16.
- Sequence remaining after third round of Flavius Josephus sieve; remove every fourth term of A047241.A056530
Sequence remaining after third round of Flavius Josephus sieve; remove every fourth term of A047241.
- Sequence remaining after a fourth round of Flavius Josephus sieve; remove every fifth term of A056530.A056531
Sequence remaining after a fourth round of Flavius Josephus sieve; remove every fifth term of A056530.
- Bond percolation series for square lattice near a wall.A056532
Bond percolation series for square lattice near a wall.
- Even sieve: start with natural numbers, remove every 2nd term, remove every 4th term from what remains, remove every 6th term from what remains, etc.A056533
Even sieve: start with natural numbers, remove every 2nd term, remove every 4th term from what remains, remove every 6th term from what remains, etc.
- Mapping from the ordering by product (A027750, A056538) to the ordering by sum (A002260, A004736) of ordered pairs (a,b), a>=1, b>=1.A056534
Mapping from the ordering by product (A027750, A056538) to the ordering by sum (A002260, A004736) of ordered pairs (a,b), a>=1, b>=1.
- Mapping from the ordering by sum to the ordering by product of the ordered pairs. Inverse permutation to A056534.A056535
Mapping from the ordering by sum to the ordering by product of the ordered pairs. Inverse permutation to A056534.
- Mapping from half-antidiagonal reading of the triangle (as used in A028297) to the column-by-column reading of the triangular tables.A056536
Mapping from half-antidiagonal reading of the triangle (as used in A028297) to the column-by-column reading of the triangular tables.
- Mapping from the column-by-column reading to the half-antidiagonal reading of the triangular tables. Inverse of A056536.A056537
Mapping from the column-by-column reading to the half-antidiagonal reading of the triangular tables. Inverse of A056536.
- Irregular triangle read by rows: row n lists the divisors of n in decreasing order.A056538
Irregular triangle read by rows: row n lists the divisors of n in decreasing order.
- Self-inverse permutation: reverse the bits in binary expansion of n and also complement them (0->1, 1->0) if the run count (A005811) is even.A056539
Self-inverse permutation: reverse the bits in binary expansion of n and also complement them (0->1, 1->0) if the run count (A005811) is even.
- a(1) = 1; to form a(n+1), append a(n)-1, a(n)+1 at the beginning and the end of a(n), respectively. Ignore any leading 0's.A056540
a(1) = 1; to form a(n+1), append a(n)-1, a(n)+1 at the beginning and the end of a(n), respectively. Ignore any leading 0's.
- a(n) = 2n*a(n-1) + 1 with a(0)=0.A056541
a(n) = 2n*a(n-1) + 1 with a(0)=0.
- a(n) = n*a(n-1) + 1, a(1) = 0.A056542
a(n) = n*a(n-1) + 1, a(1) = 0.
- a(n) = n*a(n-1) - 1 with a(1)=1.A056543
a(n) = n*a(n-1) - 1 with a(1)=1.
- Smallest palindrome containing the digits of n as a subsequence.A056544
Smallest palindrome containing the digits of n as a subsequence.
- a(n) = 4*n*a(n-1) + 1 with a(0)=1.A056545
a(n) = 4*n*a(n-1) + 1 with a(0)=1.
- a(n) = 5*n*a(n-1) + 1 with a(0)=1.A056546
a(n) = 5*n*a(n-1) + 1 with a(0)=1.
- a(n) = 6*n*a(n-1) + 1 with a(0)=1.A056547
a(n) = 6*n*a(n-1) + 1 with a(0)=1.
- a(n) = Sum_{k>=1} round(n/k) where round(1/2) = 0.A056548
a(n) = Sum_{k>=1} round(n/k) where round(1/2) = 0.
- a(n) = Sum_{k>=1} round(n/k) where round(1/2)=1.A056549
a(n) = Sum_{k>=1} round(n/k) where round(1/2)=1.
- Numbers k such that Sum_{j=1..k} sigma(j) is divisible by k, where sigma(j) = sum of divisors of j (A000203).A056550
Numbers k such that Sum_{j=1..k} sigma(j) is divisible by k, where sigma(j) = sum of divisors of j (A000203).
- Smallest cube divisible by n divided by largest cube which divides n.A056551
Smallest cube divisible by n divided by largest cube which divides n.
- Powerfree kernel of cubefree part of n.A056552
Powerfree kernel of cubefree part of n.
- Smallest 4th-power divisible by n divided by largest 4th-power which divides n.A056553
Smallest 4th-power divisible by n divided by largest 4th-power which divides n.
- Powerfree kernel of 4th-powerfree part of n.A056554
Powerfree kernel of 4th-powerfree part of n.
- Smallest number k (k>0) such that n*k is a perfect 4th power.A056555
Smallest number k (k>0) such that n*k is a perfect 4th power.
- First tetrahedral coordinate; repeat m (m+1)*(m+2)/2 times.A056556
First tetrahedral coordinate; repeat m (m+1)*(m+2)/2 times.
- Second tetrahedral coordinate.A056557
Second tetrahedral coordinate.
- Third tetrahedral coordinate, i.e., tetrahedron with T(t,n,k)=k; succession of growing finite triangles with increasing values towards bottom right.A056558
Third tetrahedral coordinate, i.e., tetrahedron with T(t,n,k)=k; succession of growing finite triangles with increasing values towards bottom right.
- Tetrahedron with T(t,n,k) = t - n; succession of growing finite triangles with declining values per row.A056559
Tetrahedron with T(t,n,k) = t - n; succession of growing finite triangles with declining values per row.
- Tetrahedron with T(t,n,k)=n-k; succession of growing finite triangles with increasing values towards bottom left.A056560
Tetrahedron with T(t,n,k)=n-k; succession of growing finite triangles with increasing values towards bottom left.