Sequences
392,541 sequences
- Triangular numbers that are 5 times another triangular number.A077261
Triangular numbers that are 5 times another triangular number.
- Second member of the Diophantine pair (m,k) that satisfies 5*(m^2 + m) = k^2 + k; a(n) = k.A077262
Second member of the Diophantine pair (m,k) that satisfies 5*(m^2 + m) = k^2 + k; a(n) = k.
- Number of (undirected) cycles in the n-th order antiprism graph.A077263
Number of (undirected) cycles in the n-th order antiprism graph.
- Table of arithmetic sequences, by antidiagonals.A077264
Table of arithmetic sequences, by antidiagonals.
- Number of cycles in the n-th order prism graph.A077265
Number of cycles in the n-th order prism graph.
- Triangle of number of zeros when n is written in base k (2 <= k <= n).A077266
Triangle of number of zeros when n is written in base k (2 <= k <= n).
- Number of zeros in base-3 expansion of n.A077267
Number of zeros in base-3 expansion of n.
- Number of bases in which n requires at least one zero to be written.A077268
Number of bases in which n requires at least one zero to be written.
- Number of connected squarefree graphs on n nodes.A077269
Number of connected squarefree graphs on n nodes.
- Duplicate of A076048.A077270
Duplicate of A076048.
- Duplicate of A072037.A077271
Duplicate of A072037.
- a(n) = Sum_{d|n} d^2*2^(d-1)*(n/d-1) for n > 0.A077272
a(n) = Sum_{d|n} d^2*2^(d-1)*(n/d-1) for n > 0.
- Ordered differences without repetitions between two successive powers of a prime but not a prime (A025475).A077273
Ordered differences without repetitions between two successive powers of a prime but not a prime (A025475).
- Differences between two successive powers of a prime but not a prime (A025475) in more than one way.A077274
Differences between two successive powers of a prime but not a prime (A025475) in more than one way.
- Least number which can be represented by the difference between two successive powers of a prime but not a prime (A077273) in just n ways.A077275
Least number which can be represented by the difference between two successive powers of a prime but not a prime (A077273) in just n ways.
- Duplicate of A073684.A077276
Duplicate of A073684.
- Duplicate of A073682.A077277
Duplicate of A073682.
- Duplicate of A073683.A077278
Duplicate of A073683.
- Last prime of n-th group of successive primes in A073684.A077279
Last prime of n-th group of successive primes in A073684.
- Sum of next a(n) successive primes is a square.A077280
Sum of next a(n) successive primes is a square.
- Square root of sum of successive primes in n-th group in A077280.A077281
Square root of sum of successive primes in n-th group in A077280.
- First prime in n-th group in A077280.A077282
First prime in n-th group in A077280.
- Last prime in n-th group in A077280.A077283
Last prime in n-th group in A077280.
- Duplicate of A070428.A077284
Duplicate of A070428.
- Number of partitions of n with designated summands.A077285
Number of partitions of n with designated summands.
- Primes which are not the difference between two successive perfect powers (A001597).A077286
Primes which are not the difference between two successive perfect powers (A001597).
- If the least prime factor of ((prime(k)*prime(k+1))^2 + 1)/2 for k >= 2 is not yet in the sequence, then add it to the sequence.A077287
If the least prime factor of ((prime(k)*prime(k+1))^2 + 1)/2 for k >= 2 is not yet in the sequence, then add it to the sequence.
- First member of the Diophantine pair (m,k) that satisfies 6(m^2 + m) = k^2 + k: a(n) = m.A077288
First member of the Diophantine pair (m,k) that satisfies 6(m^2 + m) = k^2 + k: a(n) = m.
- Triangular numbers that are 1/6 of another triangular number.A077289
Triangular numbers that are 1/6 of another triangular number.
- Triangular numbers that are 6 times other triangular numbers.A077290
Triangular numbers that are 6 times other triangular numbers.
- Second member of Diophantine pair (m,k) that satisfies 6*(m^2 + m) = k^2 + k: a(n) = k.A077291
Second member of Diophantine pair (m,k) that satisfies 6*(m^2 + m) = k^2 + k: a(n) = k.
- Numbers k with the property that k divides one of the concatenations (k-1)(k-2) or (k-2)(k-1).A077292
Numbers k with the property that k divides one of the concatenations (k-1)(k-2) or (k-2)(k-1).
- Partition the concatenation 1234567...of natural numbers into successive strings nontrivially (a(n) is not equal to n) such that the n-th string is a multiple of n.A077293
Partition the concatenation 1234567...of natural numbers into successive strings nontrivially (a(n) is not equal to n) such that the n-th string is a multiple of n.
- a(n) = A077293(n)/n.A077294
a(n) = A077293(n)/n.
- Partition the concatenation 1234567...of natural numbers into successive strings which are even, all different and > 2. (0 never taken as the most significant digit.)A077295
Partition the concatenation 1234567...of natural numbers into successive strings which are even, all different and > 2. (0 never taken as the most significant digit.)
- Partition the concatenation 1234567... of natural numbers into successive strings which are multiples of 3 all different and > 3. (0 never taken as the most significant digit.)A077296
Partition the concatenation 1234567... of natural numbers into successive strings which are multiples of 3 all different and > 3. (0 never taken as the most significant digit.)
- Partition the concatenation 1234567...of natural numbers into successive strings which are multiples of 4, all different and > 4. (0 never taken as the most significant digit.)A077297
Partition the concatenation 1234567...of natural numbers into successive strings which are multiples of 4, all different and > 4. (0 never taken as the most significant digit.)
- Partition the concatenation 1234567...of natural numbers into successive strings which are multiples of 5, all different and > 5. (0 never taken as the most significant digit.)A077298
Partition the concatenation 1234567...of natural numbers into successive strings which are multiples of 5, all different and > 5. (0 never taken as the most significant digit.)
- Partition the concatenation 1234567...of natural numbers into successive strings which are multiples of 6, all different and > 6. (0 never taken as the most significant digit.)A077299
Partition the concatenation 1234567...of natural numbers into successive strings which are multiples of 6, all different and > 6. (0 never taken as the most significant digit.)
- Partition the concatenation 1234567...of natural numbers into successive strings which are multiples of 7, all different and > 7 (0 is never taken as the most significant digit).A077300
Partition the concatenation 1234567...of natural numbers into successive strings which are multiples of 7, all different and > 7 (0 is never taken as the most significant digit).
- Partition the concatenation 1234567...of natural numbers into successive strings which are multiples of 8, all different and > 8. (0 never taken as the most significant digit.)A077301
Partition the concatenation 1234567...of natural numbers into successive strings which are multiples of 8, all different and > 8. (0 never taken as the most significant digit.)
- Partition the concatenation 1234567...of natural numbers into successive strings which are multiples of 9, all different and > 9. (0 never taken as the most significant digit.)A077302
Partition the concatenation 1234567...of natural numbers into successive strings which are multiples of 9, all different and > 9. (0 never taken as the most significant digit.)
- Partition the concatenation 235711131719232931...of prime numbers into successive strings such that the n-th string is a multiple of n and >n.A077303
Partition the concatenation 235711131719232931...of prime numbers into successive strings such that the n-th string is a multiple of n and >n.
- Partition the concatenation 235711131719232931...of prime numbers into successive strings such that the n-th string is a multiple of prime(n) and > prime(n).A077304
Partition the concatenation 235711131719232931...of prime numbers into successive strings such that the n-th string is a multiple of prime(n) and > prime(n).
- Partition the concatenation 468910121415161820212224252627283032... of composite numbers into successive strings such that the n-th string is a multiple of prime(n) and > prime(n).A077305
Partition the concatenation 468910121415161820212224252627283032... of composite numbers into successive strings such that the n-th string is a multiple of prime(n) and > prime(n).
- Smallest multiple of n formed by the concatenation of n successive numbers, or 0 if no such number exists.A077306
Smallest multiple of n formed by the concatenation of n successive numbers, or 0 if no such number exists.
- Partial sums of theta series of diamond (A005925).A077307
Partial sums of theta series of diamond (A005925).
- Duplicate of A075001.A077308
Duplicate of A075001.
- Concatenation of n numbers starting with n.A077309
Concatenation of n numbers starting with n.
- Smallest multiple of n that is a concatenation of (increasing) natural numbers starting with(n+1).A077310
Smallest multiple of n that is a concatenation of (increasing) natural numbers starting with(n+1).