Sequences
392,541 sequences
- [ exp(1/8)*n! ].A030961
[ exp(1/8)*n! ].
- [ exp(6/7)*n! ].A030962
[ exp(6/7)*n! ].
- a(n) = floor( exp(5/7)*n! ).A030963
a(n) = floor( exp(5/7)*n! ).
- [ exp(4/7)*n! ].A030964
[ exp(4/7)*n! ].
- [ exp(3/7)*n! ].A030965
[ exp(3/7)*n! ].
- [ exp(2/7)*n! ].A030966
[ exp(2/7)*n! ].
- [ exp(1/7)*n! ].A030967
[ exp(1/7)*n! ].
- [ exp(5/6)*n! ].A030968
[ exp(5/6)*n! ].
- [ exp(1/6)*n! ].A030969
[ exp(1/6)*n! ].
- [ exp(4/5)*n! ].A030970
[ exp(4/5)*n! ].
- [ exp(3/5)*n! ].A030971
[ exp(3/5)*n! ].
- [ exp(2/5)*n! ].A030972
[ exp(2/5)*n! ].
- [ exp(1/5)*n! ].A030973
[ exp(1/5)*n! ].
- [ exp(3/4)*n! ].A030974
[ exp(3/4)*n! ].
- [ exp(1/4)*n! ].A030975
[ exp(1/4)*n! ].
- a(n) = floor(exp(2/3)*n!).A030976
a(n) = floor(exp(2/3)*n!).
- a(n) = floor(exp(1/3)*n!).A030977
a(n) = floor(exp(1/3)*n!).
- Maximal number of non-attacking knights on an n X n board.A030978
Maximal number of non-attacking knights on an n X n board.
- Numbers k such that binomial(2k,k) is not divisible by 3, 5 or 7.A030979
Numbers k such that binomial(2k,k) is not divisible by 3, 5 or 7.
- Number of planted noncrossing bushes with n nodes; i.e., rooted noncrossing trees with n nodes, root degree 1 and no nonroot nodes of degree 1.A030980
Number of planted noncrossing bushes with n nodes; i.e., rooted noncrossing trees with n nodes, root degree 1 and no nonroot nodes of degree 1.
- Number of noncrossing bushes with n nodes; i.e., rooted noncrossing trees with n nodes and no nonroot nodes of degree 1.A030981
Number of noncrossing bushes with n nodes; i.e., rooted noncrossing trees with n nodes and no nonroot nodes of degree 1.
- Number of noncrossing nonplanted bushes with n nodes, i.e., rooted noncrossing trees with n nodes and no nodes of degree 1.A030982
Number of noncrossing nonplanted bushes with n nodes, i.e., rooted noncrossing trees with n nodes and no nodes of degree 1.
- Number of rooted noncrossing trees with n nodes such that root has degree 1 and the child of the root has degree at least 2.A030983
Number of rooted noncrossing trees with n nodes such that root has degree 1 and the child of the root has degree at least 2.
- 2-automorphic numbers: final digits of 2*n^2 agree with n.A030984
2-automorphic numbers: final digits of 2*n^2 agree with n.
- 3-automorphic numbers ending in 2: final digits of 3*n^2 agree with n.A030985
3-automorphic numbers ending in 2: final digits of 3*n^2 agree with n.
- 3-automorphic numbers ending in 5: final digits of 3*n^2 agree with n.A030986
3-automorphic numbers ending in 5: final digits of 3*n^2 agree with n.
- 4-automorphic numbers: final digits of 4*n^2 agree with n.A030987
4-automorphic numbers: final digits of 4*n^2 agree with n.
- 5-automorphic numbers: final digits of 5n^2 agree with n.A030988
5-automorphic numbers: final digits of 5n^2 agree with n.
- 6-automorphic numbers: final digits of 6n^2 agree with n.A030989
6-automorphic numbers: final digits of 6n^2 agree with n.
- 7-automorphic numbers ending in 3: final digits of 7n^2 agree with n.A030990
7-automorphic numbers ending in 3: final digits of 7n^2 agree with n.
- 7-automorphic numbers ending in 5: final digits of 7n^2 agree with n.A030991
7-automorphic numbers ending in 5: final digits of 7n^2 agree with n.
- 7-automorphic numbers ending in 8: final digits of 7n^2 agree with n.A030992
7-automorphic numbers ending in 8: final digits of 7n^2 agree with n.
- 8-automorphic numbers: final digits of 8*n^2 agree with n.A030993
8-automorphic numbers: final digits of 8*n^2 agree with n.
- 9-automorphic numbers ending in 4: final digits of 9*n^2 agree with n.A030994
9-automorphic numbers ending in 4: final digits of 9*n^2 agree with n.
- 9-automorphic numbers ending in 5: final digits of 9*n^2 agree with n.A030995
9-automorphic numbers ending in 5: final digits of 9*n^2 agree with n.
- Concatenation of n consecutive primes starting with the prime a(n) is a prime.A030996
Concatenation of n consecutive primes starting with the prime a(n) is a prime.
- Smallest prime which is a concatenation of n consecutive primes.A030997
Smallest prime which is a concatenation of n consecutive primes.
- Write n in base 7 and juxtapose.A030998
Write n in base 7 and juxtapose.
- Position of n-th 0 in A030998.A030999
Position of n-th 0 in A030998.
- Position of n-th 1 in A030998.A031000
Position of n-th 1 in A030998.
- Position of n-th 2 in A030998.A031001
Position of n-th 2 in A030998.
- Position of n-th 3 in A030998.A031002
Position of n-th 3 in A030998.
- Position of n-th 4 in A030998.A031003
Position of n-th 4 in A030998.
- Position of n-th 5 in A030998.A031004
Position of n-th 5 in A030998.
- Position of n-th 6 in A030998.A031005
Position of n-th 6 in A030998.
- a(n)=least k such that base 7 representation of n begins at s(k), where s=A030998.A031006
a(n)=least k such that base 7 representation of n begins at s(k), where s=A030998.
- Triangle T(n,k): Write n in base 7, reverse order of digits, to get row n.A031007
Triangle T(n,k): Write n in base 7, reverse order of digits, to get row n.
- Position of n-th 0 in A031007.A031008
Position of n-th 0 in A031007.
- Position of n-th 1 in A031007.A031009
Position of n-th 1 in A031007.
- Position of n-th 2 in A031007.A031010
Position of n-th 2 in A031007.