Sequences
392,541 sequences
- Smallest n-digit prime whose external digits as well as internal digits form a prime, or 0 if no such number exists.A077361
Smallest n-digit prime whose external digits as well as internal digits form a prime, or 0 if no such number exists.
- Largest n-digit prime whose external digits as well as internal digits form a prime, or 0 if no such number exists.A077362
Largest n-digit prime whose external digits as well as internal digits form a prime, or 0 if no such number exists.
- Smallest n-digit square whose external digits as well as internal digits form a square, or 0 if no such number exists.A077363
Smallest n-digit square whose external digits as well as internal digits form a square, or 0 if no such number exists.
- Largest n-digit square whose external digits as well as internal digits form a square, or 0 if no such number exists.A077364
Largest n-digit square whose external digits as well as internal digits form a square, or 0 if no such number exists.
- Sum of products of factorials of parts in all partitions of n.A077365
Sum of products of factorials of parts in all partitions of n.
- Triangular numbers whose internal digits form a triangular number. Or triangular number such that deleting the MSD and LSD leaves a triangular number.A077366
Triangular numbers whose internal digits form a triangular number. Or triangular number such that deleting the MSD and LSD leaves a triangular number.
- Triangular numbers whose external digits form a triangular number. Or triangular number whose MSD and LSD form a triangular number.A077367
Triangular numbers whose external digits form a triangular number. Or triangular number whose MSD and LSD form a triangular number.
- Triangular numbers whose external digits as well as internal digits form triangular numbers.A077368
Triangular numbers whose external digits as well as internal digits form triangular numbers.
- Smallest n-digit triangular number whose external digits as well as internal digits form triangular numbers, or -1 if no such number exists.A077369
Smallest n-digit triangular number whose external digits as well as internal digits form triangular numbers, or -1 if no such number exists.
- Largest n-digit triangular number whose external digits as well as internal digits form a triangular number, or 0 if no such number exists.A077370
Largest n-digit triangular number whose external digits as well as internal digits form a triangular number, or 0 if no such number exists.
- Fibonacci numbers whose internal digits form a Fibonacci number. Equivalently, Fibonacci numbers from which deleting the MSD and LSD leaves a Fibonacci number.A077371
Fibonacci numbers whose internal digits form a Fibonacci number. Equivalently, Fibonacci numbers from which deleting the MSD and LSD leaves a Fibonacci number.
- Fibonacci numbers whose external digits form a Fibonacci number. Or Fibonacci numbers whose MSD and LSD form a Fibonacci number.A077372
Fibonacci numbers whose external digits form a Fibonacci number. Or Fibonacci numbers whose MSD and LSD form a Fibonacci number.
- Fibonacci numbers whose external digits as well as internal digits form a Fibonacci number.A077373
Fibonacci numbers whose external digits as well as internal digits form a Fibonacci number.
- Odd numbers m whose abundance by absolute value is at most 10, that is, -10 <= sigma(m) - 2m <= 10.A077374
Odd numbers m whose abundance by absolute value is at most 10, that is, -10 <= sigma(m) - 2m <= 10.
- Numbers k such that 2^k + prime(k) is prime.A077375
Numbers k such that 2^k + prime(k) is prime.
- Squarefree numbers whose internal digits form a squarefree number.A077376
Squarefree numbers whose internal digits form a squarefree number.
- Squarefree numbers whose external digits form a squarefree number.A077377
Squarefree numbers whose external digits form a squarefree number.
- Squarefree numbers whose external as well as internal digits form a squarefree number.A077378
Squarefree numbers whose external as well as internal digits form a squarefree number.
- Smallest n-digit squarefree number whose internal as well as external digits form a squarefree number greater than 1; or 0 if no such number exists.A077379
Smallest n-digit squarefree number whose internal as well as external digits form a squarefree number greater than 1; or 0 if no such number exists.
- Largest n-digit squarefree number whose internal as well as external digits form a squarefree number, or 0 if no such number exists.A077380
Largest n-digit squarefree number whose internal as well as external digits form a squarefree number, or 0 if no such number exists.
- Number of squarefree numbers between successive squares (exclusive).A077381
Number of squarefree numbers between successive squares (exclusive).
- a(1) = 1, then multiply, add and subtract 2, 3, 4; 5, 6, 7; ... in that order.A077382
a(1) = 1, then multiply, add and subtract 2, 3, 4; 5, 6, 7; ... in that order.
- a(1) = 1, then add, multiply and subtract 2, 3, 4; 5, 6, 7; ... in that order.A077383
a(1) = 1, then add, multiply and subtract 2, 3, 4; 5, 6, 7; ... in that order.
- a(1) = 1, then add, multiply, subtract, multiply 2, 3, 4, 5; 6, 7, 8, 9; ... in that order.A077384
a(1) = 1, then add, multiply, subtract, multiply 2, 3, 4, 5; 6, 7, 8, 9; ... in that order.
- Triangle read by rows in which n-th row contains 2n-1 terms starting from n^0 to n^(n-1) in increasing order and then in decreasing order to n^0.A077385
Triangle read by rows in which n-th row contains 2n-1 terms starting from n^0 to n^(n-1) in increasing order and then in decreasing order to n^0.
- Sums of rows of triangle in A077385.A077386
Sums of rows of triangle in A077385.
- Continued fraction expansion of Product_{p prime} (1 + p/((p-1)^2*(p+1))).A077387
Continued fraction expansion of Product_{p prime} (1 + p/((p-1)^2*(p+1))).
- Row sums of the triangle in A122820.A077388
Row sums of the triangle in A122820.
- Smallest integer that is the average of n consecutive primes.A077389
Smallest integer that is the average of n consecutive primes.
- Primes which leave primes at every step if most significant digit and least significant digit are deleted until a one digit or two digit prime is obtained.A077390
Primes which leave primes at every step if most significant digit and least significant digit are deleted until a one digit or two digit prime is obtained.
- Smallest n-digit prime which leaves a prime at every step if most significant digit and least significant digit are deleted until a one digit or two digit prime is obtained, or 0 if no such prime exists.A077391
Smallest n-digit prime which leaves a prime at every step if most significant digit and least significant digit are deleted until a one digit or two digit prime is obtained, or 0 if no such prime exists.
- Number of n-node simple graphs having clique number 5.A077392
Number of n-node simple graphs having clique number 5.
- Number of n-node simple graphs having clique number 6.A077393
Number of n-node simple graphs having clique number 6.
- Number of n-node simple graphs having clique number 7.A077394
Number of n-node simple graphs having clique number 7.
- Lesser of two successive squarefree numbers whose product is not squarefree.A077395
Lesser of two successive squarefree numbers whose product is not squarefree.
- Square roots of squares arising in A076991.A077396
Square roots of squares arising in A076991.
- Expansion of (1+31*x-2*x^2-2*x^3)/(1-16*x^2+x^4).A077397
Expansion of (1+31*x-2*x^2-2*x^3)/(1-16*x^2+x^4).
- First member of the Diophantine pair (m,k) that satisfies 7*(m^2+m) = k^2+k; a(n)=m.A077398
First member of the Diophantine pair (m,k) that satisfies 7*(m^2+m) = k^2+k; a(n)=m.
- Triangular numbers that are 1/7 of triangular numbers.A077399
Triangular numbers that are 1/7 of triangular numbers.
- Triangular numbers that are 7 times triangular numbers.A077400
Triangular numbers that are 7 times triangular numbers.
- Second member of Diophantine pair (m,k) that satisfies 7*(m^2 + m) = k^2 + k; a(n) = k.A077401
Second member of Diophantine pair (m,k) that satisfies 7*(m^2 + m) = k^2 + k; a(n) = k.
- Reverse and Add! carried out in base 3; number of steps needed to reach a palindrome, or -1 if no palindrome is ever reached.A077402
Reverse and Add! carried out in base 3; number of steps needed to reach a palindrome, or -1 if no palindrome is ever reached.
- In base 3: smallest number that requires n Reverse and Add! steps to reach a palindrome.A077403
In base 3: smallest number that requires n Reverse and Add! steps to reach a palindrome.
- Trajectory of n under the Reverse and Add! operation carried out in base 3 (presumably) does not reach a palindrome.A077404
Trajectory of n under the Reverse and Add! operation carried out in base 3 (presumably) does not reach a palindrome.
- Trajectory of n under the Reverse and Add! operation carried out in base 3 (presumably) does not reach a palindrome and (presumably) does not join the trajectory of any term m < n.A077405
Trajectory of n under the Reverse and Add! operation carried out in base 3 (presumably) does not reach a palindrome and (presumably) does not join the trajectory of any term m < n.
- In base 3: n sets a new record for the number of Reverse and Add! steps needed to reach a palindrome starting with n.A077406
In base 3: n sets a new record for the number of Reverse and Add! steps needed to reach a palindrome starting with n.
- In base 3, records for the number of Reverse and Add! steps needed to reach a palindrome.A077407
In base 3, records for the number of Reverse and Add! steps needed to reach a palindrome.
- Trajectory of 103 under the Reverse and Add! operation carried out in base 3, written in base 10.A077408
Trajectory of 103 under the Reverse and Add! operation carried out in base 3, written in base 10.
- Bisection (even part) of Chebyshev sequence with Diophantine property.A077409
Bisection (even part) of Chebyshev sequence with Diophantine property.
- Combined Diophantine Chebyshev sequences A077249 and A077251.A077410
Combined Diophantine Chebyshev sequences A077249 and A077251.