Sequences
392,541 sequences
- a(n) = n + (square excess of n).A094761
a(n) = n + (square excess of n).
- a(n) = Bell(n+1) - 2^n + 1 + n, where Bell(i) is the i-th Bell number A000110(i).A094762
a(n) = Bell(n+1) - 2^n + 1 + n, where Bell(i) is the i-th Bell number A000110(i).
- Trajectory of 2 under repeated application of the map n -> n + square excess of n.A094763
Trajectory of 2 under repeated application of the map n -> n + square excess of n.
- Trajectory of 7 under repeated application of the map n --> n + square excess of n.A094764
Trajectory of 7 under repeated application of the map n --> n + square excess of n.
- a(n) = n + 2 * square excess of n.A094765
a(n) = n + 2 * square excess of n.
- Trajectory of 11 under repeated application of the map n -> n + 2*square excess of n (see A094765).A094766
Trajectory of 11 under repeated application of the map n -> n + 2*square excess of n (see A094765).
- Square spiral of sums of selected preceding terms, starting at 1 (a spiral Fibonacci-like sequence).A094767
Square spiral of sums of selected preceding terms, starting at 1 (a spiral Fibonacci-like sequence).
- Square spiral of sums of selected preceding terms, starting at 1 (a spiral Fibonacci-like sequence).A094768
Square spiral of sums of selected preceding terms, starting at 1 (a spiral Fibonacci-like sequence).
- Square spiral of sums of selected preceding terms, starting at 0 followed by 1 (a spiral Fibonacci-like sequence).A094769
Square spiral of sums of selected preceding terms, starting at 0 followed by 1 (a spiral Fibonacci-like sequence).
- Decimal expansion of Pi^(e + Pi).A094770
Decimal expansion of Pi^(e + Pi).
- Decimal expansion of e^(e + Pi).A094771
Decimal expansion of e^(e + Pi).
- Decimal expansion of e^(Pi - e).A094772
Decimal expansion of e^(Pi - e).
- Decimal expansion of e^(e - Pi).A094773
Decimal expansion of e^(e - Pi).
- Decimal expansion of Pi^(e - Pi).A094774
Decimal expansion of Pi^(e - Pi).
- Decimal expansion of Pi^(Pi - e).A094775
Decimal expansion of Pi^(Pi - e).
- a(n) = largest k such that the decimal representation of 2^k does not contain the digit n.A094776
a(n) = largest k such that the decimal representation of 2^k does not contain the digit n.
- Number of legal positions in Go played on an n X n grid (each group must have at least one liberty).A094777
Number of legal positions in Go played on an n X n grid (each group must have at least one liberty).
- "Dropping time" in juggler sequence problem starting at 2n+1 (number of steps to reach a lower number than starting value).A094778
"Dropping time" in juggler sequence problem starting at 2n+1 (number of steps to reach a lower number than starting value).
- Let 2^k = smallest power of 2 >= binomial(n,[n/2]); a(n) = 2^k - binomial(n,[n/2]).A094779
Let 2^k = smallest power of 2 >= binomial(n,[n/2]); a(n) = 2^k - binomial(n,[n/2]).
- Let 2^k = smallest power of 2 >= binomial(2n,n); a(n) = 2^k - binomial(2n,n).A094780
Let 2^k = smallest power of 2 >= binomial(2n,n); a(n) = 2^k - binomial(2n,n).
- Array T(i,j), i>=1, j >= 1, forming a two-dimensional version of A090822, read by antidiagonals.A094781
Array T(i,j), i>=1, j >= 1, forming a two-dimensional version of A090822, read by antidiagonals.
- 4th row of array in A094781.A094782
4th row of array in A094781.
- Numbers k such that, for all m < k, d_i(k) <= d_i(m) for i=1 to Min(d(k),d(m)), where d_i(k) denotes the i-th smallest divisor of k.A094783
Numbers k such that, for all m < k, d_i(k) <= d_i(m) for i=1 to Min(d(k),d(m)), where d_i(k) denotes the i-th smallest divisor of k.
- Numbers that are neither squares nor cubes.A094784
Numbers that are neither squares nor cubes.
- Triangle read by rows: T(n,k) is the number of permutations p of [n] such that the length of the longest 2-stack sortable initial segment of p is equal to k.A094785
Triangle read by rows: T(n,k) is the number of permutations p of [n] such that the length of the longest 2-stack sortable initial segment of p is equal to k.
- Primes that are 2 less than a perfect power m^k, k >= 2.A094786
Primes that are 2 less than a perfect power m^k, k >= 2.
- a(n) = smallest prime p such that p + n is a perfect power m^k, k >= 2.A094787
a(n) = smallest prime p such that p + n is a perfect power m^k, k >= 2.
- Number of (s(0), s(1), ..., s(2n+1)) such that 0 < s(i) < 10 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n+1, s(0) = 1, s(2n+1) = 6.A094788
Number of (s(0), s(1), ..., s(2n+1)) such that 0 < s(i) < 10 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n+1, s(0) = 1, s(2n+1) = 6.
- Number of (s(0), s(1), ..., s(2n+1)) such that 0 < s(i) < 7 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n+1, s(0) = 1, s(2n+1) = 4.A094789
Number of (s(0), s(1), ..., s(2n+1)) such that 0 < s(i) < 7 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n+1, s(0) = 1, s(2n+1) = 4.
- Number of (s(0), s(1), ..., s(2n)) such that 0 < s(i) < 7 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2*n, s(0) = 1, s(2n) = 3.A094790
Number of (s(0), s(1), ..., s(2n)) such that 0 < s(i) < 7 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2*n, s(0) = 1, s(2n) = 3.
- Triangle read by rows giving coefficients of polynomials arising in successive differences of (n!)_{n>=0}.A094791
Triangle read by rows giving coefficients of polynomials arising in successive differences of (n!)_{n>=0}.
- a(n) = (1/n!)*A001565(n).A094792
a(n) = (1/n!)*A001565(n).
- a(n) = (1/n!)*A001688(n).A094793
a(n) = (1/n!)*A001688(n).
- a(n) = (1/n!)*A001689(n).A094794
a(n) = (1/n!)*A001689(n).
- a(n) = (1/n!)*A023043(n).A094795
a(n) = (1/n!)*A023043(n).
- Triangle read by rows giving coefficients of polynomials arising in successive differences of central binomial numbers.A094796
Triangle read by rows giving coefficients of polynomials arising in successive differences of central binomial numbers.
- Number of times 1 is used in writing out all numbers 1 through 10^n.A094797
Number of times 1 is used in writing out all numbers 1 through 10^n.
- Number of times 1 is used in writing out all the numbers 1 through n.A094798
Number of times 1 is used in writing out all the numbers 1 through n.
- First term of a run of 10 consecutive numbers such that for each m in the 10-tuple exactly m 1's are used in writing out all numbers 1 through m.A094799
First term of a run of 10 consecutive numbers such that for each m in the 10-tuple exactly m 1's are used in writing out all numbers 1 through m.
- First term of a run of exactly two consecutive numbers such that for each m in the run, exactly m 1's are used in writing out all numbers 1 through m.A094800
First term of a run of exactly two consecutive numbers such that for each m in the run, exactly m 1's are used in writing out all numbers 1 through m.
- Numbers k such that k is a term of A014778, but k-1 and k+1 are not.A094801
Numbers k such that k is a term of A014778, but k-1 and k+1 are not.
- a(n) = smallest k such that all of 1 through n divides k!.A094802
a(n) = smallest k such that all of 1 through n divides k!.
- Number of (s(0), s(1), ..., s(2n)) such that 0 < s(i) < 8 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n, s(0) = 1, s(2n) = 3.A094803
Number of (s(0), s(1), ..., s(2n)) such that 0 < s(i) < 8 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n, s(0) = 1, s(2n) = 3.
- Number of primes in the trajectory of n under the juggler map of A094683.A094804
Number of primes in the trajectory of n under the juggler map of A094683.
- Duplicate of A055193.A094805
Duplicate of A055193.
- Number of (s(0), s(1), ..., s(2n)) such that 0 < s(i) < 8 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n, s(0) = 1, s(2n) = 5.A094806
Number of (s(0), s(1), ..., s(2n)) such that 0 < s(i) < 8 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n, s(0) = 1, s(2n) = 5.
- Numbers n such that primitive solutions for 1/n^2 = 1/x^2 + 1/y^2 exist.A094807
Numbers n such that primitive solutions for 1/n^2 = 1/x^2 + 1/y^2 exist.
- Numbers of the form Fibonacci(p-1)/p, where p are primes ending in 1 or 9 (i.e., A045468).A094808
Numbers of the form Fibonacci(p-1)/p, where p are primes ending in 1 or 9 (i.e., A045468).
- Numbers of the form Fibonacci(p+1)/p, where p are primes >= 7 that end in 3 or 7 (i.e., p = A003631(n) for n > 2).A094809
Numbers of the form Fibonacci(p+1)/p, where p are primes >= 7 that end in 3 or 7 (i.e., p = A003631(n) for n > 2).
- Primes of the form F(k)*F(k+1) + F(k+2).A094810
Primes of the form F(k)*F(k+1) + F(k+2).