Sequences
392,541 sequences
- Start with a(1)=4; apply 4 -> 665, 5 -> 56665, 6 -> 566665; iterate.A081261
Start with a(1)=4; apply 4 -> 665, 5 -> 56665, 6 -> 566665; iterate.
- Number of distinct (modulo rotation and reflection) n X n associative magic squares.A081262
Number of distinct (modulo rotation and reflection) n X n associative magic squares.
- Number of distinct (modulo rotation and reflection) n X n associative panmagic squares.A081263
Number of distinct (modulo rotation and reflection) n X n associative panmagic squares.
- Odd Fibonacci pseudoprimes: odd composite numbers k such that either (1) k divides Fibonacci(k-1) if k == +-1 (mod 5) or (2) k divides Fibonacci(k+1) if k == +-2 (mod 5).A081264
Odd Fibonacci pseudoprimes: odd composite numbers k such that either (1) k divides Fibonacci(k-1) if k == +-1 (mod 5) or (2) k divides Fibonacci(k+1) if k == +-2 (mod 5).
- Triangle of coefficients of the polynomials a(n, x) = 2*a(n-1, x)+ x^2*a(n-2,x), n >= 1, a(0, x) = 1, a(1, x) = 1.A081265
Triangle of coefficients of the polynomials a(n, x) = 2*a(n-1, x)+ x^2*a(n-2,x), n >= 1, a(0, x) = 1, a(1, x) = 1.
- Staggered diagonal of triangular spiral in A051682.A081266
Staggered diagonal of triangular spiral in A051682.
- Diagonal of triangular spiral in A051682.A081267
Diagonal of triangular spiral in A051682.
- Diagonal of triangular spiral in A051682.A081268
Diagonal of triangular spiral in A051682.
- Duplicate of A064226.A081269
Duplicate of A064226.
- Diagonal of triangular spiral in A051682.A081270
Diagonal of triangular spiral in A051682.
- Vertical of triangular spiral in A051682.A081271
Vertical of triangular spiral in A051682.
- Downward vertical of triangular spiral in A051682.A081272
Downward vertical of triangular spiral in A051682.
- Duplicate of A060544.A081273
Duplicate of A060544.
- Duplicate of A038764.A081274
Duplicate of A038764.
- Shallow diagonal of triangular spiral in A051682.A081275
Shallow diagonal of triangular spiral in A051682.
- Floor(n^3/8).A081276
Floor(n^3/8).
- Square array of unsigned coefficients of Chebyshev polynomials of the first kind.A081277
Square array of unsigned coefficients of Chebyshev polynomials of the first kind.
- Binomial transform of Chebyshev polynomial coefficients A001793.A081278
Binomial transform of Chebyshev polynomial coefficients A001793.
- Binomial transform of Chebyshev coefficients A001794.A081279
Binomial transform of Chebyshev coefficients A001794.
- Binomial transform of Chebyshev coefficients A006974.A081280
Binomial transform of Chebyshev coefficients A006974.
- Square array of binomial transforms of Chebyshev polynomial coefficients.A081281
Square array of binomial transforms of Chebyshev polynomial coefficients.
- Generalized centered polygonal numbers.A081282
Generalized centered polygonal numbers.
- An interleaved sequence of pyramidal and polygonal numbers.A081283
An interleaved sequence of pyramidal and polygonal numbers.
- An interleaved sequence of pyramidal and polygonal numbers.A081284
An interleaved sequence of pyramidal and polygonal numbers.
- Table of coefficients of polynomials f_n(q) defined by 1/Product_{i>=1} (1-a q^i)^i = Sum_{n>=0} a^n q^n f_n(q) / ((q)_n)^2, where (x)_n is the q-Pochhammer symbol, defined to be Product_{i=0..n-1} (1-x q^i).A081285
Table of coefficients of polynomials f_n(q) defined by 1/Product_{i>=1} (1-a q^i)^i = Sum_{n>=0} a^n q^n f_n(q) / ((q)_n)^2, where (x)_n is the q-Pochhammer symbol, defined to be Product_{i=0..n-1} (1-x q^i).
- For n<=11, a(n) = n mod 10. For even n>11, a(n) = (2a(n-1)+1) mod 10. For odd n>11, a(n) = (a(n-1)+a(i+1)) mod 10, where i is the largest integer < n-1 such that a(i)=a(n-1).A081286
For n<=11, a(n) = n mod 10. For even n>11, a(n) = (2a(n-1)+1) mod 10. For odd n>11, a(n) = (a(n-1)+a(i+1)) mod 10, where i is the largest integer < n-1 such that a(i)=a(n-1).
- Excess area when consecutive squares of sizes 1 to n are packed into the smallest possible rectangle.A081287
Excess area when consecutive squares of sizes 1 to n are packed into the smallest possible rectangle.
- a(n) is the minimal i such that A000108(i) > n.A081288
a(n) is the minimal i such that A000108(i) > n.
- a(0) = 0, a(n) = A081293(A081288(n)-1).A081289
a(0) = 0, a(n) = A081293(A081288(n)-1).
- a(0) = 0, and for n >=1, a(n) = the largest Catalan number <= n.A081290
a(0) = 0, and for n >=1, a(n) = the largest Catalan number <= n.
- Complement of A072795.A081291
Complement of A072795.
- Intersection of A014486 and A079946.A081292
Intersection of A014486 and A079946.
- a(n) = A000108(n) + A014137(n).A081293
a(n) = A000108(n) + A014137(n).
- Expansion of (1-2*x)/(1-4*x).A081294
Expansion of (1-2*x)/(1-4*x).
- a(n) = (-1)^(n+1) * coefficient of x^n in Sum_{k>=1} x^k/(1+2*x^k).A081295
a(n) = (-1)^(n+1) * coefficient of x^n in Sum_{k>=1} x^k/(1+2*x^k).
- Primes of the form 2^k - k.A081296
Primes of the form 2^k - k.
- Array T(k,n), read by antidiagonals: T(k,n) = ((k+1)^(n+1)-(-k)^(n+1))/(2k+1).A081297
Array T(k,n), read by antidiagonals: T(k,n) = ((k+1)^(n+1)-(-k)^(n+1))/(2k+1).
- Main diagonal of the square array A081297.A081298
Main diagonal of the square array A081297.
- Diagonal of square array A081297.A081299
Diagonal of square array A081297.
- Diagonal of square array A081297.A081300
Diagonal of square array A081297.
- Subdiagonal of square array A081297.A081301
Subdiagonal of square array A081297.
- Subdiagonal of square array A081297.A081302
Subdiagonal of square array A081297.
- gpf(m) - 2*spf(m), where gpf(m) is the greatest and spf(m) is the smallest prime factor of m (A006530, A020639).A081303
gpf(m) - 2*spf(m), where gpf(m) is the greatest and spf(m) is the smallest prime factor of m (A006530, A020639).
- Number of numbers m <= n with prime factors less than 2*spf(m), where spf(m) is the smallest prime factor of m (A020639).A081304
Number of numbers m <= n with prime factors less than 2*spf(m), where spf(m) is the smallest prime factor of m (A020639).
- Number of numbers m <= n with at least one prime factor greater than 2*spf(m), where spf(m) is the smallest prime factor of m (A020639).A081305
Number of numbers m <= n with at least one prime factor greater than 2*spf(m), where spf(m) is the smallest prime factor of m (A020639).
- Numbers n with prime factors less than 2*spf(n), where spf(m) is the smallest prime factor of m (A020639).A081306
Numbers n with prime factors less than 2*spf(n), where spf(m) is the smallest prime factor of m (A020639).
- a(n) = (n+1)*tau(n) - sigma(n).A081307
a(n) = (n+1)*tau(n) - sigma(n).
- Number of ways to write n as sum of a prime and an 3-smooth number.A081308
Number of ways to write n as sum of a prime and an 3-smooth number.
- Smallest prime p such that n-p is a 3-smooth number, a(n)=0 if no such prime exists.A081309
Smallest prime p such that n-p is a 3-smooth number, a(n)=0 if no such prime exists.
- Numbers having no representation as sum of a prime and an 3-smooth number.A081310
Numbers having no representation as sum of a prime and an 3-smooth number.