Sequences
392,541 sequences
- Partial sum of usigma is divisible by n, where usigma(n) = A034448(n) and summatory-usigma(n) = A064609(n).A064611
Partial sum of usigma is divisible by n, where usigma(n) = A034448(n) and summatory-usigma(n) = A064609(n).
- Partial sum of bigomega is divisible by n, where bigomega(n)=A001222(n) and summatory-bigomega(n)=A022559(n).A064612
Partial sum of bigomega is divisible by n, where bigomega(n)=A001222(n) and summatory-bigomega(n)=A022559(n).
- Second binomial transform of the Catalan numbers.A064613
Second binomial transform of the Catalan numbers.
- Exchange 2 and 3 in the prime factorization of n.A064614
Exchange 2 and 3 in the prime factorization of n.
- Numbers of the form m * 6^k for k >= 0 and m > 0 with gcd(m, 6) = 1.A064615
Numbers of the form m * 6^k for k >= 0 and m > 0 with gcd(m, 6) = 1.
- a(n) = (10^n-1)*(91/81)-n*10^n/9.A064616
a(n) = (10^n-1)*(91/81)-n*10^n/9.
- a(n) = (10^n - 1)*(80/81) + n/9.A064617
a(n) = (10^n - 1)*(80/81) + n/9.
- Stirling transform of (n!)^2.A064618
Stirling transform of (n!)^2.
- Decimal expansion of sqrt(2*log(2)).A064619
Decimal expansion of sqrt(2*log(2)).
- Duplicate of A064216.A064620
Duplicate of A064216.
- Values of A005132(n) at which the ratio A005132(n)/n sets a new record.A064621
Values of A005132(n) at which the ratio A005132(n)/n sets a new record.
- Values of n at which the ratio A005132(n)/n sets a new record.A064622
Values of n at which the ratio A005132(n)/n sets a new record.
- Primitive subsequence of A066031: terms of A066031 which are not a multiple of some previous terms.A064623
Primitive subsequence of A066031: terms of A066031 which are not a multiple of some previous terms.
- Generalization of the Genocchi numbers given by the Gandhi polynomials A(n+1,r) = r^3 A(n, r + 1) - (r - 1)^3 A(n, r); A(1,r) = r^3 - (r-1)^3.A064624
Generalization of the Genocchi numbers given by the Gandhi polynomials A(n+1,r) = r^3 A(n, r + 1) - (r - 1)^3 A(n, r); A(1,r) = r^3 - (r-1)^3.
- Generalization of the Genocchi numbers. Generated by the Gandhi polynomials A(n+1,r) = r^4*A(n,r+1) - (r-1)^4*A(n,r); A(1,r) = r^4 - (r-1)^4.A064625
Generalization of the Genocchi numbers. Generated by the Gandhi polynomials A(n+1,r) = r^4*A(n,r+1) - (r-1)^4*A(n,r); A(1,r) = r^4 - (r-1)^4.
- Football tournament numbers: the number of possible point series for a tournament of n teams playing each other once where 3 points are awarded to the winning team and 1 to each in the case of a tie.A064626
Football tournament numbers: the number of possible point series for a tournament of n teams playing each other once where 3 points are awarded to the winning team and 1 to each in the case of a tie.
- Positive integers not in A064494.A064627
Positive integers not in A064494.
- a(n) = floor((4/3)^n).A064628
a(n) = floor((4/3)^n).
- a(n) = 4^n mod 3^n.A064629
a(n) = 4^n mod 3^n.
- Number of parts if 4^n is partitioned into parts of size 3^n as far as possible into parts of size 2^n as far as possible and into parts of size 1^n.A064630
Number of parts if 4^n is partitioned into parts of size 3^n as far as possible into parts of size 2^n as far as possible and into parts of size 1^n.
- a(n) = ceiling(log_2(A064630(n))).A064631
a(n) = ceiling(log_2(A064630(n))).
- Smallest prime p such that n = (p-1)/(q-1) for some prime q.A064632
Smallest prime p such that n = (p-1)/(q-1) for some prime q.
- a(n) = 3^n*n!*(n+2)!/2!.A064633
a(n) = 3^n*n!*(n+2)!/2!.
- a(0) = 0 and a(n) = Min { i > a(n-1) | A064466(i + 1) - A064466(i) > 2 } for n > 0.A064634
a(0) = 0 and a(n) = Min { i > a(n-1) | A064466(i + 1) - A064466(i) > 2 } for n > 0.
- Even numbers > 6 not appearing in A064466. a(n) = A064466(A064634(n)) + 2 for n > 0.A064635
Even numbers > 6 not appearing in A064466. a(n) = A064466(A064634(n)) + 2 for n > 0.
- Number of derangements up to cyclic rotations; permutation siteswap necklaces, with no fixed points (no "zero-throws", i.e., empty hands, if we use the mapping Perm2SiteSwap1 of A060495 and A060498).A064636
Number of derangements up to cyclic rotations; permutation siteswap necklaces, with no fixed points (no "zero-throws", i.e., empty hands, if we use the mapping Perm2SiteSwap1 of A060495 and A060498).
- Setwise difference of A060132 and A059590. Those terms of A060132 which are not representable as a sum of distinct factorials.A064637
Setwise difference of A060132 and A059590. Those terms of A060132 which are not representable as a sum of distinct factorials.
- Positions of non-crossing fixed-point-free involutions encoded by A014486 in A055089. Permutation of A064640.A064638
Positions of non-crossing fixed-point-free involutions encoded by A014486 in A055089. Permutation of A064640.
- Positions of non-crossing fixed-point-free involutions encoded by A014486 (after reflection) in A055089. Permutation of A064640.A064639
Positions of non-crossing fixed-point-free involutions encoded by A014486 (after reflection) in A055089. Permutation of A064640.
- Positions of non-crossing fixed-point-free involutions (encoded by A014486) in A055089, sorted to ascending order.A064640
Positions of non-crossing fixed-point-free involutions (encoded by A014486) in A055089, sorted to ascending order.
- Unidirectional 'Delannoy' variation of the Boustrophedon transform applied to all 1's sequence: construct an array in which the first element of each row is 1 and subsequent entries are given by T(n,k) = T(n,k-1) + T(n-1,k-1) + T(n-1,k) + T(n-2,k-1). The last number in row n gives a(n).A064641
Unidirectional 'Delannoy' variation of the Boustrophedon transform applied to all 1's sequence: construct an array in which the first element of each row is 1 and subsequent entries are given by T(n,k) = T(n,k-1) + T(n-1,k-1) + T(n-1,k) + T(n-2,k-1). The last number in row n gives a(n).
- Triangle defined in A064641 read by rows.A064642
Triangle defined in A064641 read by rows.
- Bidirectional 'Delannoy' variation of the Boustrophedon transform applied to all 1's sequence: Fill an triangular array in alternating directions. Let the first element of each row in that direction be equal to 1. Each next entry is given by T(n,k) = T(n,k +/- 1) + T(n-1,k-1) + T(n-1,k) + T(n-2,k-1), where the +/- depends on which is the previous element in the direction one is filling in the row. The final number of row n gives a(n).A064643
Bidirectional 'Delannoy' variation of the Boustrophedon transform applied to all 1's sequence: Fill an triangular array in alternating directions. Let the first element of each row in that direction be equal to 1. Each next entry is given by T(n,k) = T(n,k +/- 1) + T(n-1,k-1) + T(n-1,k) + T(n-2,k-1), where the +/- depends on which is the previous element in the direction one is filling in the row. The final number of row n gives a(n).
- Array defined in A064643 read from left to right (cf. A107783).A064644
Array defined in A064643 read from left to right (cf. A107783).
- Table where the entry (n,k) (n >= 0, k >= 0) gives number of Motzkin paths of the length n with the minimum peak width of k.A064645
Table where the entry (n,k) (n >= 0, k >= 0) gives number of Motzkin paths of the length n with the minimum peak width of k.
- Numerators of partial sums of reciprocals of primorial numbers.A064646
Numerators of partial sums of reciprocals of primorial numbers.
- Denominators of partial sums of reciprocals of primorial numbers.A064647
Denominators of partial sums of reciprocals of primorial numbers.
- Decimal expansion of sum of reciprocals of primorial numbers: 1/2 + 1/6 + 1/30 + 1/210 + ...A064648
Decimal expansion of sum of reciprocals of primorial numbers: 1/2 + 1/6 + 1/30 + 1/210 + ...
- Row sums of the table A047916.A064649
Row sums of the table A047916.
- a(n) = floor(a(n-1)/2) + a(n-2) with a(0)=1, a(1)=2.A064650
a(n) = floor(a(n-1)/2) + a(n-2) with a(0)=1, a(1)=2.
- a(n) = ceiling(a(n-1)/2) + a(n-2) with a(0)=0 and a(1)=1.A064651
a(n) = ceiling(a(n-1)/2) + a(n-2) with a(0)=0 and a(1)=1.
- Primes q associated with A064632.A064652
Primes q associated with A064632.
- Integers not expressible as p + q*a^2, a>1 and p, q are primes.A064653
Integers not expressible as p + q*a^2, a>1 and p, q are primes.
- Length of n-th run of evens or odds in A064413.A064654
Length of n-th run of evens or odds in A064413.
- Length of n-th run of even numbers in A064413.A064655
Length of n-th run of even numbers in A064413.
- Length of n-th run of odd numbers in A064413.A064656
Length of n-th run of odd numbers in A064413.
- a(n) = a(|n - a(n-3)|) + a(|n - a(n-4)|) for n > 3, a(n)=1 otherwise.A064657
a(n) = a(|n - a(n-3)|) + a(|n - a(n-4)|) for n > 3, a(n)=1 otherwise.
- a(n) = ceiling(prime(n) - n*log(n)).A064658
a(n) = ceiling(prime(n) - n*log(n)).
- a(n) = round(prime(n) - n*log(n)).A064659
a(n) = round(prime(n) - n*log(n)).
- The number of distinct parts in the partition sequence lambda(n) formed by the recurrence lambda(1) = 1 and lambda(n+1) is the sum of lambda(n) and its conjugate.A064660
The number of distinct parts in the partition sequence lambda(n) formed by the recurrence lambda(1) = 1 and lambda(n+1) is the sum of lambda(n) and its conjugate.