Sequences
392,541 sequences
- 2nd row of Family 1 "90 X 150 array": generations 0 .. n of Rule 90 starting from seed pattern 7.A048711
2nd row of Family 1 "90 X 150 array": generations 0 .. n of Rule 90 starting from seed pattern 7.
- 2nd column of Family 1 "90 X 150 array": generations 0 .. n of Rule 150 starting from seed pattern 5.A048712
2nd column of Family 1 "90 X 150 array": generations 0 .. n of Rule 150 starting from seed pattern 5.
- 3rd row of Family 1 "90 x 150 array": generations 0 .. n of Rule 90 starting from seed pattern 21.A048713
3rd row of Family 1 "90 x 150 array": generations 0 .. n of Rule 90 starting from seed pattern 21.
- 3rd column of Family 1 "90 x 150 array": generations 0 .. n of Rule 150 starting from seed pattern 17.A048714
3rd column of Family 1 "90 x 150 array": generations 0 .. n of Rule 150 starting from seed pattern 17.
- Binary expansion matches (100(0)*)*(0|1|10)?; or, Zeckendorf-like expansion of n using recurrence f(n) = f(n-1) + f(n-3).A048715
Binary expansion matches (100(0)*)*(0|1|10)?; or, Zeckendorf-like expansion of n using recurrence f(n) = f(n-1) + f(n-3).
- Numbers k such that (k AND 4*k) = 0, where AND is bitwise-and.A048716
Numbers k such that (k AND 4*k) = 0, where AND is bitwise-and.
- Binary expansion matches ((0)*00(1*)11)*(0*).A048717
Binary expansion matches ((0)*00(1*)11)*(0*).
- Binary expansion matches ((0)*0001)*(0*); or, Zeckendorf-like expansion of n using recurrence f(n) = f(n-1) + f(n-4).A048718
Binary expansion matches ((0)*0001)*(0*); or, Zeckendorf-like expansion of n using recurrence f(n) = f(n-1) + f(n-4).
- Binary expansion matches ((0)*0011)*(0*).A048719
Binary expansion matches ((0)*0011)*(0*).
- Multiplication table {0..i} X {0..j} of binary polynomials (polynomials over GF(2)) interpreted as binary vectors, then written in base 10; or, binary multiplication without carries.A048720
Multiplication table {0..i} X {0..j} of binary polynomials (polynomials over GF(2)) interpreted as binary vectors, then written in base 10; or, binary multiplication without carries.
- Binary packing of Fibonacci sequence A000045.A048721
Binary packing of Fibonacci sequence A000045.
- Reversed binary packing of Fibonacci sequence A000045.A048722
Reversed binary packing of Fibonacci sequence A000045.
- Binary "exponentiation" without carries: {0..y}^{0..x}, where y (column index) is binary encoding of GF(2)-polynomial and x (row index) is the exponent.A048723
Binary "exponentiation" without carries: {0..y}^{0..x}, where y (column index) is binary encoding of GF(2)-polynomial and x (row index) is the exponent.
- Write n and 2n in binary and add them mod 2.A048724
Write n and 2n in binary and add them mod 2.
- a(n) = Xmult(n,5) or rule90(n,1).A048725
a(n) = Xmult(n,5) or rule90(n,1).
- a(n) = Xmult(n,6), or 2*A048724(n).A048726
a(n) = Xmult(n,6), or 2*A048724(n).
- a(n) = Xmult(n,7) or rule150(n,1).A048727
a(n) = Xmult(n,7) or rule150(n,1).
- Differences between A008585 (multiples of 3) and A048724.A048728
Differences between A008585 (multiples of 3) and A048724.
- Differences between A008587 (multiples of 5) and A048725.A048729
Differences between A008587 (multiples of 5) and A048725.
- Differences between A008589 (multiples of 7) and A048727, a(n) = ((n*7)-Xmult(n,7)).A048730
Differences between A008589 (multiples of 7) and A048727, a(n) = ((n*7)-Xmult(n,7)).
- Main diagonal of A048723, a(n) = Xpower(n,n).A048731
Main diagonal of A048723, a(n) = Xpower(n,n).
- a(n) = Xpower(n,3).A048732
a(n) = Xpower(n,3).
- a(n) = A048730(n)/4.A048733
a(n) = A048730(n)/4.
- a(n) = Xpower(n,5).A048734
a(n) = Xpower(n,5).
- a(n) = (n AND floor(n/2)), where AND is bitwise and-operator (A004198).A048735
a(n) = (n AND floor(n/2)), where AND is bitwise and-operator (A004198).
- Dana Scott's sequence: a(n) = (a(n-2) + a(n-1) * a(n-3)) / a(n-4), a(0) = a(1) = a(2) = a(3) = 1.A048736
Dana Scott's sequence: a(n) = (a(n-2) + a(n-1) * a(n-3)) / a(n-4), a(0) = a(1) = a(2) = a(3) = 1.
- Numbers whose prime divisors consist of primes p such that 2^p-1 is prime.A048737
Numbers whose prime divisors consist of primes p such that 2^p-1 is prime.
- Number of self-avoiding walks on square lattice rotated by Pi/4, with wedge angle Pi/2.A048738
Number of self-avoiding walks on square lattice rotated by Pi/4, with wedge angle Pi/2.
- Expansion of 1/((1 - x)*(1 - 2*x - x^2)).A048739
Expansion of 1/((1 - x)*(1 - 2*x - x^2)).
- Product of divisors of n-th composite number.A048740
Product of divisors of n-th composite number.
- Product of aliquot divisors of composite n (1 and primes omitted).A048741
Product of aliquot divisors of composite n (1 and primes omitted).
- a(n) = n! - (n-th Bell number).A048742
a(n) = n! - (n-th Bell number).
- Triangle read by rows: T(n,k) = k!*binomial(n-1,k-1)*Stirling2(n,k), 1 <= k <= n.A048743
Triangle read by rows: T(n,k) = k!*binomial(n-1,k-1)*Stirling2(n,k), 1 <= k <= n.
- Numbers k such that 2^k - k is prime.A048744
Numbers k such that 2^k - k is prime.
- Partial sums of A048654.A048745
Partial sums of A048654.
- Partial sums of A048655.A048746
Partial sums of A048655.
- Factor composite n, divide sum of divisors by number of divisors; append n to sequence if quotient is integral and not previously seen.A048747
Factor composite n, divide sum of divisors by number of divisors; append n to sequence if quotient is integral and not previously seen.
- Mean integral divisors associated with A048747.A048748
Mean integral divisors associated with A048747.
- Factor n, divide sum of aliquot divisors by number of aliquot divisors; append n to sequence if quotient is integral and not previously seen.A048749
Factor n, divide sum of aliquot divisors by number of aliquot divisors; append n to sequence if quotient is integral and not previously seen.
- Mean integral aliquot divisors associated with A048749.A048750
Mean integral aliquot divisors associated with A048749.
- Composites k whose product of divisors divided by number of divisors is an integer.A048751
Composites k whose product of divisors divided by number of divisors is an integer.
- Mean integral divisors associated with A048751.A048752
Mean integral divisors associated with A048751.
- Composite numbers k whose product of aliquot divisors divided by number of aliquot divisors is an integer.A048753
Composite numbers k whose product of aliquot divisors divided by number of aliquot divisors is an integer.
- Mean integral quotients associated with A048753.A048754
Mean integral quotients associated with A048753.
- Partial sums of A048693.A048755
Partial sums of A048693.
- Prime repunits in ascending prime bases (written in decimal).A048756
Prime repunits in ascending prime bases (written in decimal).
- Sum_{i=0..2n} (C(2n,i) mod 2)*Fibonacci(i+2) = Sum_{i=0..n} (C(n,i) mod 2)*Fibonacci(2i+2).A048757
Sum_{i=0..2n} (C(2n,i) mod 2)*Fibonacci(i+2) = Sum_{i=0..n} (C(n,i) mod 2)*Fibonacci(2i+2).
- Erroneous version of A048798.A048758
Erroneous version of A048798.
- Longest perimeter of a Pythagorean triangle with n as length of one of the three sides.A048759
Longest perimeter of a Pythagorean triangle with n as length of one of the three sides.
- Largest square <= n.A048760
Largest square <= n.