Sequences
392,541 sequences
- Numbers which need six 'Reverse and Add' steps to reach a palindrome.A065211
Numbers which need six 'Reverse and Add' steps to reach a palindrome.
- Numbers which need seven 'Reverse and Add' steps to reach a palindrome.A065212
Numbers which need seven 'Reverse and Add' steps to reach a palindrome.
- Numbers which need eight 'Reverse and Add' steps to reach a palindrome.A065213
Numbers which need eight 'Reverse and Add' steps to reach a palindrome.
- Numbers which need nine 'Reverse and Add' steps to reach a palindrome.A065214
Numbers which need nine 'Reverse and Add' steps to reach a palindrome.
- Numbers which need ten 'Reverse and Add' steps to reach a palindrome.A065215
Numbers which need ten 'Reverse and Add' steps to reach a palindrome.
- Numbers which need eleven 'Reverse and Add' steps to reach a palindrome.A065216
Numbers which need eleven 'Reverse and Add' steps to reach a palindrome.
- Numbers which need 12 'Reverse and Add' steps to reach a palindrome.A065217
Numbers which need 12 'Reverse and Add' steps to reach a palindrome.
- Consider the subsets of proper divisors of a number that sum to the number. These are numbers that set a record number of such subsets.A065218
Consider the subsets of proper divisors of a number that sum to the number. These are numbers that set a record number of such subsets.
- Number of subsets of proper divisors of numbers in A065218 summing to the number.A065219
Number of subsets of proper divisors of numbers in A065218 summing to the number.
- a(n) = Fibonacci(n) - n.A065220
a(n) = Fibonacci(n) - n.
- Fill a triangular array by rows by writing numbers 1 up to b(0), 1 up to b(1), etc., where b(n) are the pentagonal numbers. The final elements of the rows form a(n).A065221
Fill a triangular array by rows by writing numbers 1 up to b(0), 1 up to b(1), etc., where b(n) are the pentagonal numbers. The final elements of the rows form a(n).
- Fill a triangular array by rows by writing numbers 1 up to b(0), 1 up to b(1), etc., where b(n) are the hexagonal numbers. The final elements of the rows form a(n).A065222
Fill a triangular array by rows by writing numbers 1 up to b(0), 1 up to b(1), etc., where b(n) are the hexagonal numbers. The final elements of the rows form a(n).
- Fill a triangular array by rows by writing numbers 1 up to b(0), 1 up to b(1), etc., where b(n) are the heptagonal numbers (A000566). The final elements of the rows form a(n).A065223
Fill a triangular array by rows by writing numbers 1 up to b(0), 1 up to b(1), etc., where b(n) are the heptagonal numbers (A000566). The final elements of the rows form a(n).
- Fill a triangular array by rows by writing numbers 1 up to b(0), 1 up to b(1), etc., where b(n) are the octagonal numbers. The final elements of the rows form a(n).A065224
Fill a triangular array by rows by writing numbers 1 up to b(0), 1 up to b(1), etc., where b(n) are the octagonal numbers. The final elements of the rows form a(n).
- Fill a triangular array by rows by writing numbers 1 up to b(0), 1 up to b(1), etc., where b(n) are the 9-gonal (nonagonal) numbers. The final elements of the rows form a(n).A065225
Fill a triangular array by rows by writing numbers 1 up to b(0), 1 up to b(1), etc., where b(n) are the 9-gonal (nonagonal) numbers. The final elements of the rows form a(n).
- Fill a triangular array by rows by writing numbers 1 up to b(0), 1 up to b(1), etc., where b(n) are the decagonal numbers. The final elements of the rows form a(n).A065226
Fill a triangular array by rows by writing numbers 1 up to b(0), 1 up to b(1), etc., where b(n) are the decagonal numbers. The final elements of the rows form a(n).
- Fill a triangular array by rows by writing numbers 1 up to b(0), 1 up to b(1), etc., where b(n) are the triangular numbers. The first elements of the rows form a(n).A065227
Fill a triangular array by rows by writing numbers 1 up to b(0), 1 up to b(1), etc., where b(n) are the triangular numbers. The first elements of the rows form a(n).
- Fill a triangular array by rows by writing numbers 1 up to b(0), 1 up to b(1), etc., where b(n) are the square numbers. The first elements of the rows form a(n).A065228
Fill a triangular array by rows by writing numbers 1 up to b(0), 1 up to b(1), etc., where b(n) are the square numbers. The first elements of the rows form a(n).
- Fill a triangular array by rows by writing numbers 1 up to b(0), 1 up to b(1), etc., where b(n) are the pentagonal numbers. The first elements of the rows form a(n).A065229
Fill a triangular array by rows by writing numbers 1 up to b(0), 1 up to b(1), etc., where b(n) are the pentagonal numbers. The first elements of the rows form a(n).
- Fill a triangular array by rows by writing numbers 1 up to b(0), 1 up to b(1), etc., where b(n) are the hexagonal numbers. The first elements of the rows form a(n).A065230
Fill a triangular array by rows by writing numbers 1 up to b(0), 1 up to b(1), etc., where b(n) are the hexagonal numbers. The first elements of the rows form a(n).
- Fill a triangular array by rows by writing numbers 1 up to b(0), 1 up to b(1), etc., where b(n) are the heptagonal numbers (A000566). The first elements of the rows form a(n).A065231
Fill a triangular array by rows by writing numbers 1 up to b(0), 1 up to b(1), etc., where b(n) are the heptagonal numbers (A000566). The first elements of the rows form a(n).
- Fill a triangular array by rows by writing numbers 1 up to b(0), 1 up to b(1), etc., where b(n) are the octagonal numbers. The first elements of the rows form a(n).A065232
Fill a triangular array by rows by writing numbers 1 up to b(0), 1 up to b(1), etc., where b(n) are the octagonal numbers. The first elements of the rows form a(n).
- Fill a triangular array by rows by writing numbers 1 up to b(0), 1 up to b(1), etc., where the b(n) are the nonzero 9-gonal (nonagonal) numbers 1, 9, 24, 46, ... (A001106). The initial elements of the rows form a(n).A065233
Fill a triangular array by rows by writing numbers 1 up to b(0), 1 up to b(1), etc., where the b(n) are the nonzero 9-gonal (nonagonal) numbers 1, 9, 24, 46, ... (A001106). The initial elements of the rows form a(n).
- Fill a triangular array by rows by writing numbers 1 up to b(0), 1 up to b(1), etc., where b(n) are the decagonal numbers. The first elements of the rows form a(n).A065234
Fill a triangular array by rows by writing numbers 1 up to b(0), 1 up to b(1), etc., where b(n) are the decagonal numbers. The first elements of the rows form a(n).
- Odd numbers which can be written in precisely one way as sum of a subset of their proper divisors.A065235
Odd numbers which can be written in precisely one way as sum of a subset of their proper divisors.
- a(n) = (4*n)!*(n+1)!/(2*n)!.A065236
a(n) = (4*n)!*(n+1)!/(2*n)!.
- Number of winning length n strings with a 4-symbol alphabet in "same game".A065237
Number of winning length n strings with a 4-symbol alphabet in "same game".
- Number of winning length n strings with a 5-symbol alphabet in "same game".A065238
Number of winning length n strings with a 5-symbol alphabet in "same game".
- Number of winning length n strings with a 6-symbol alphabet in "same game".A065239
Number of winning length n strings with a 6-symbol alphabet in "same game".
- Number of winning length n strings with a 7-symbol alphabet in "same game".A065240
Number of winning length n strings with a 7-symbol alphabet in "same game".
- Number of winning length n strings with an 8-symbol alphabet in "same game".A065241
Number of winning length n strings with an 8-symbol alphabet in "same game".
- Number of winning length n strings with a 9-symbol alphabet in "same game".A065242
Number of winning length n strings with a 9-symbol alphabet in "same game".
- Number of winning length n strings with a 10-symbol alphabet in "same game".A065243
Number of winning length n strings with a 10-symbol alphabet in "same game".
- Primes of form p = 2 + Sum_{k = 1..m} k^2 for some m.A065244
Primes of form p = 2 + Sum_{k = 1..m} k^2 for some m.
- Positive numbers k such that 2 + Sum_{j = 1..k} j^2 is a prime.A065245
Positive numbers k such that 2 + Sum_{j = 1..k} j^2 is a prime.
- Formal neural networks with n components.A065246
Formal neural networks with n components.
- Imperfect formal neural networks with n components.A065247
Imperfect formal neural networks with n components.
- Networks with n components.A065248
Networks with n components.
- Permutation of N induced by the order-preserving permutation of the positive rational numbers (x -> x/2), positions in Stern-Brocot tree.A065249
Permutation of N induced by the order-preserving permutation of the positive rational numbers (x -> x/2), positions in Stern-Brocot tree.
- Permutation of N induced by the order-preserving permutation of the positive rational numbers (x -> 2x), positions in Stern-Brocot tree.A065250
Permutation of N induced by the order-preserving permutation of the positive rational numbers (x -> 2x), positions in Stern-Brocot tree.
- Simple quasi-periodic sequence consisting of the terms 1, 0 and -1.A065251
Simple quasi-periodic sequence consisting of the terms 1, 0 and -1.
- The sequence A065251 reduced modulo 3 (i.e., replace every -1 with 2).A065252
The sequence A065251 reduced modulo 3 (i.e., replace every -1 with 2).
- a(n) = 10*(A064823(n)-1) + A000796(n).A065253
a(n) = 10*(A064823(n)-1) + A000796(n).
- "Inverse" to A065253.A065254
"Inverse" to A065253.
- Consider the sequence b(k) such that b(k) and sigma(b(k)) end with the same digit in base 10. Sequence gives values of b(k) such that b(k)/k = 10.A065255
Consider the sequence b(k) such that b(k) and sigma(b(k)) end with the same digit in base 10. Sequence gives values of b(k) such that b(k)/k = 10.
- Quintal Queens permutation of N: halve or multiply by 3 (mod 5) each digit (0->0, 1->3, 2->1, 3->4, 4->2) of the base 5 representation of n.A065256
Quintal Queens permutation of N: halve or multiply by 3 (mod 5) each digit (0->0, 1->3, 2->1, 3->4, 4->2) of the base 5 representation of n.
- Quintal Queens permutation of N: double (mod 5) each digit (0->0, 1->2, 2->4, 3->1, 4->3) of the base-5 representation of n-1, add one.A065257
Quintal Queens permutation of N: double (mod 5) each digit (0->0, 1->2, 2->4, 3->1, 4->3) of the base-5 representation of n-1, add one.
- Quintal Queens permutation of N: halve or multiply by 3 (mod 5) each digit (0->0, 1->3, 2->1, 3->4, 4->2) of the base 5 representation of n-1, add one.A065258
Quintal Queens permutation of N: halve or multiply by 3 (mod 5) each digit (0->0, 1->3, 2->1, 3->4, 4->2) of the base 5 representation of n-1, add one.
- A057114 conjugated with A059893, inverse of A065260.A065259
A057114 conjugated with A059893, inverse of A065260.
- A057115 conjugated with A059893, inverse of A065259.A065260
A057115 conjugated with A059893, inverse of A065259.