Sequences
392,541 sequences
- a(n) = Sum(((k-1)/2)*k!*Stirling_2(n,k),k=1..n).A083411
a(n) = Sum(((k-1)/2)*k!*Stirling_2(n,k),k=1..n).
- Wythoff array read by rising antidiagonals.A083412
Wythoff array read by rising antidiagonals.
- a(n) = Sum_{d|n} d*2^(d-1) for n > 0.A083413
a(n) = Sum_{d|n} d*2^(d-1) for n > 0.
- Write the numbers from 1 to n^2 consecutively in n rows of length n; let c(k) = number of primes in k-th column; a(n) = minimal c(k) for gcd(k,n) = 1.A083414
Write the numbers from 1 to n^2 consecutively in n rows of length n; let c(k) = number of primes in k-th column; a(n) = minimal c(k) for gcd(k,n) = 1.
- Triangle read by rows: T(n,k) is defined as follows. Write the numbers from 1 to n^2 consecutively in n rows of length n; T(n,k) = number of primes in k-th row.A083415
Triangle read by rows: T(n,k) is defined as follows. Write the numbers from 1 to n^2 consecutively in n rows of length n; T(n,k) = number of primes in k-th row.
- Add 1, double, add 1, double, etc.A083416
Add 1, double, add 1, double, etc.
- Primitive recursive function r(z, r(s, r(s, r(s, p_2)))) at (n, 0).A083417
Primitive recursive function r(z, r(s, r(s, r(s, p_2)))) at (n, 0).
- Smallest positive integer m such that m+i^2=0 mod p_i (i-th prime) for 1<=i<=n.A083418
Smallest positive integer m such that m+i^2=0 mod p_i (i-th prime) for 1<=i<=n.
- Positions of records in A066888.A083419
Positions of records in A066888.
- a(n) = 2*4^n - 1.A083420
a(n) = 2*4^n - 1.
- a(n)=2*5^n-2^n.A083421
a(n)=2*5^n-2^n.
- Positions of records in A083403.A083422
Positions of records in A083403.
- a(n) = (5*3^n + (-3)^n)/6.A083423
a(n) = (5*3^n + (-3)^n)/6.
- a(n) = (5*4^n + (-2)^n)/6.A083424
a(n) = (5*4^n + (-2)^n)/6.
- a(n) = (5*5^n + (-1)^n)/6.A083425
a(n) = (5*5^n + (-1)^n)/6.
- a(n) = (4*7^n+2^n)/5.A083426
a(n) = (4*7^n+2^n)/5.
- Smallest prime which is a concatenation of n distinct primes.A083427
Smallest prime which is a concatenation of n distinct primes.
- Smallest prime that can be formed using the digits of first 3n+1 numbers, or 0 if no such number exists.A083428
Smallest prime that can be formed using the digits of first 3n+1 numbers, or 0 if no such number exists.
- Smallest multiple of n that can be formed using the digits of first n natural numbers.A083429
Smallest multiple of n that can be formed using the digits of first n natural numbers.
- Smallest k such that k*n is a number that is a permutation of the digits of first n numbers. a(n) = A083429(n)/n.A083430
Smallest k such that k*n is a number that is a permutation of the digits of first n numbers. a(n) = A083429(n)/n.
- Largest multiple of n that can be formed using the digits of first n natural numbers.A083431
Largest multiple of n that can be formed using the digits of first n natural numbers.
- Largest k such that n*k is a number that is formed using all the digits of first n numbers. a(n) = A083431(n)/n.A083432
Largest k such that n*k is a number that is formed using all the digits of first n numbers. a(n) = A083431(n)/n.
- a(1) = 1; a palindrome is included in the sequence if it has a prime signature that is different from all previous terms.A083433
a(1) = 1; a palindrome is included in the sequence if it has a prime signature that is different from all previous terms.
- a(n) = smallest palindrome not included earlier and with the same prime signature as n, or 0 if no such palindrome exists.A083434
a(n) = smallest palindrome not included earlier and with the same prime signature as n, or 0 if no such palindrome exists.
- Palindromes with distinct prime signatures that occur naturally. Smallest palindrome with a prime signature of A025487(n), or 0 if no such number exists.A083435
Palindromes with distinct prime signatures that occur naturally. Smallest palindrome with a prime signature of A025487(n), or 0 if no such number exists.
- Smallest palindrome which is 1 more than the product of n consecutive numbers.A083436
Smallest palindrome which is 1 more than the product of n consecutive numbers.
- Write decimal expansion of Pi in triangular form; sequence gives right edge.A083437
Write decimal expansion of Pi in triangular form; sequence gives right edge.
- Smallest 2n-1 digit palindromic prime with digit sum of 2n-1, or 0 if no such number exists.A083438
Smallest 2n-1 digit palindromic prime with digit sum of 2n-1, or 0 if no such number exists.
- a(1) = 3; then a(n+1) = smallest prime not already in the sequence such that the concatenations a(n)a(n+1) and a(n+1)a(n) are both primes.A083439
a(1) = 3; then a(n+1) = smallest prime not already in the sequence such that the concatenations a(n)a(n+1) and a(n+1)a(n) are both primes.
- Smallest n-digit palindrome with a digit sum of n.A083440
Smallest n-digit palindrome with a digit sum of n.
- Largest n-digit palindrome with a digit sum of n.A083441
Largest n-digit palindrome with a digit sum of n.
- Primes in A083440.A083442
Primes in A083440.
- Primes in A083441.A083443
Primes in A083441.
- Erroneous duplicate of A052034.A083444
Erroneous duplicate of A052034.
- Largest n-digit number minus the product of its digits; i.e., a(n) = 99999... (n 9's) - 9^n.A083445
Largest n-digit number minus the product of its digits; i.e., a(n) = 99999... (n 9's) - 9^n.
- a(n) = ((10^n - 1) - 9^n)/9.A083446
a(n) = ((10^n - 1) - 9^n)/9.
- a(n) = floor( n*R(n)/(n+R(n))), where R(n) is the digit reversal of n (A004086).A083447
a(n) = floor( n*R(n)/(n+R(n))), where R(n) is the digit reversal of n (A004086).
- Concatenation of first n numbers - n!. a(n) = 1234567891011... up to n - 1*2*3*4*5*6*7*8*9*10*11... up to n.A083448
Concatenation of first n numbers - n!. a(n) = 1234567891011... up to n - 1*2*3*4*5*6*7*8*9*10*11... up to n.
- a(n) = A019566(n)/9, where A019566(n) = concat(n,...,1) - concat(1,...,n).A083449
a(n) = A019566(n)/9, where A019566(n) = concat(n,...,1) - concat(1,...,n).
- Positions of records in A084840.A083450
Positions of records in A084840.
- (n concatenated n times) - n^n.A083451
(n concatenated n times) - n^n.
- a(n) = (n times concatenation of n - n^n) divided by n, or a(n) = A083451(n) /n.A083452
a(n) = (n times concatenation of n - n^n) divided by n, or a(n) = A083451(n) /n.
- a(n) = (concatenation of numbers from n to 1) - n^n.A083453
a(n) = (concatenation of numbers from n to 1) - n^n.
- Positions of records in A084841.A083454
Positions of records in A084841.
- Duplicate of A083829.A083455
Duplicate of A083829.
- Smallest nontrivial k such that k^n + 1 is a palindrome (k>1 for n>1).A083456
Smallest nontrivial k such that k^n + 1 is a palindrome (k>1 for n>1).
- Smallest nontrivial k such that k^n - 1 is a palindrome (k >1 for n>1).A083457
Smallest nontrivial k such that k^n - 1 is a palindrome (k >1 for n>1).
- Numbers n such that n^5 + 1 is a palindrome.A083458
Numbers n such that n^5 + 1 is a palindrome.
- Palindromes arising in A083458.A083459
Palindromes arising in A083458.
- Palindromes arising in A083456.A083460
Palindromes arising in A083456.