Sequences
392,541 sequences
- Expansion of g.f. (1-x)/(1-16*x).A090411
Expansion of g.f. (1-x)/(1-16*x).
- A Chebyshev transform of 2^n.A090412
A Chebyshev transform of 2^n.
- A Chebyshev transform of 3^n.A090413
A Chebyshev transform of 3^n.
- Triangular array read by rows, 1<=k<=n: T(n,k) = smallest prime that in binary representation is not contained in n^k.A090414
Triangular array read by rows, 1<=k<=n: T(n,k) = smallest prime that in binary representation is not contained in n^k.
- a(n) = Floor[4*Pi*n/(E)].A090415
a(n) = Floor[4*Pi*n/(E)].
- a(n) = if Floor[(2*Pi/E)*m] is prime then Floor[(2*Pi/E)*m].A090416
a(n) = if Floor[(2*Pi/E)*m] is prime then Floor[(2*Pi/E)*m].
- Primes of the form floor(2*Pi*n/(e*log(n))).A090417
Primes of the form floor(2*Pi*n/(e*log(n))).
- Number of ways to write n in binary representation as a concatenation of primes.A090418
Number of ways to write n in binary representation as a concatenation of primes.
- Numbers that cannot be written in binary representation as concatenation of primes.A090419
Numbers that cannot be written in binary representation as concatenation of primes.
- Numbers having a unique representation as concatenation of primes in binary.A090420
Numbers having a unique representation as concatenation of primes in binary.
- Numbers that can be written in binary representation as concatenation of primes.A090421
Numbers that can be written in binary representation as concatenation of primes.
- Primes that cannot be written in binary representation as concatenation of other primes.A090422
Primes that cannot be written in binary representation as concatenation of other primes.
- Primes that can be written in binary representation as concatenation of other primes.A090423
Primes that can be written in binary representation as concatenation of other primes.
- Smallest number that can be written in binary representation as concatenation of other primes in exactly n ways.A090424
Smallest number that can be written in binary representation as concatenation of other primes in exactly n ways.
- Number of iterations required for happy number A007770(n) to converge to 1.A090425
Number of iterations required for happy number A007770(n) to converge to 1.
- a(1) = 1, otherwise a(n) = floor(Pi^(n+1)/(Pi^2 + 1)).A090426
a(1) = 1, otherwise a(n) = floor(Pi^(n+1)/(Pi^2 + 1)).
- Let b(0)=0; b(1)=1; b(n+2)=(e^g-1/e^g)*b(n+1)+b(n). a(n)=floor(b(n)).A090427
Let b(0)=0; b(1)=1; b(n+2)=(e^g-1/e^g)*b(n+1)+b(n). a(n)=floor(b(n)).
- Numbers that are k-gons for two or more k's, where k = 3, 4, 5, ..., 16.A090428
Numbers that are k-gons for two or more k's, where k = 3, 4, 5, ..., 16.
- 3-digit numbers that do not resolve to 495 under the Kaprekar routine.A090429
3-digit numbers that do not resolve to 495 under the Kaprekar routine.
- a(n) = if Floor[2*Pi*PrimePi[m]/E] is prime then Floor[2*Pi*PrimePi[m]/E].A090430
a(n) = if Floor[2*Pi*PrimePi[m]/E] is prime then Floor[2*Pi*PrimePi[m]/E].
- Difference between sums of digits of n and n-th prime.A090431
Difference between sums of digits of n and n-th prime.
- Primes prime(k) having a greater sum of digits than does k.A090432
Primes prime(k) having a greater sum of digits than does k.
- Primes p(k) having a smaller sum of digits than k.A090433
Primes p(k) having a smaller sum of digits than k.
- a(n) = if Floor[(2*Pi/E)*m^2] is prime then Floor[(2*Pi/E)*m^2].A090434
a(n) = if Floor[(2*Pi/E)*m^2] is prime then Floor[(2*Pi/E)*m^2].
- Triangle of signed numbers used for the computation of the column sequences of triangle A090217.A090435
Triangle of signed numbers used for the computation of the column sequences of triangle A090217.
- Denominators used to compute the column sequences of triangle A090217.A090436
Denominators used to compute the column sequences of triangle A090217.
- Alternating row sums of array A078740 ((3,2)-Stirling2).A090437
Alternating row sums of array A078740 ((3,2)-Stirling2).
- Generalized Stirling2 array (4,2).A090438
Generalized Stirling2 array (4,2).
- Alternating row sums of array A090438 ((4,2)-Stirling2).A090439
Alternating row sums of array A090438 ((4,2)-Stirling2).
- Generalized Stirling2 array (4,3).A090440
Generalized Stirling2 array (4,3).
- Symmetric triangle of certain normalized products of decreasing factorials.A090441
Symmetric triangle of certain normalized products of decreasing factorials.
- Row sums of array A090452 (s2_{3,2}, scaled (3,2)-Stirling2).A090442
Row sums of array A090452 (s2_{3,2}, scaled (3,2)-Stirling2).
- a(n) = (n+2)! * (n+1)! * n! / 2.A090443
a(n) = (n+2)! * (n+1)! * n! / 2.
- Fifth column (m=4) of triangle A090441.A090444
Fifth column (m=4) of triangle A090441.
- Row sums of triangle A090441.A090445
Row sums of triangle A090441.
- Alternating row sums of triangle A090441.A090446
Alternating row sums of triangle A090441.
- Triangle of partial products of binomials.A090447
Triangle of partial products of binomials.
- Fourth column (m=3) of triangle A090447.A090448
Fourth column (m=3) of triangle A090447.
- Fifth column (m=4) of triangle A090447.A090449
Fifth column (m=4) of triangle A090447.
- Row sums of triangle A090447.A090450
Row sums of triangle A090447.
- Alternating row sums of triangle A090447.A090451
Alternating row sums of triangle A090447.
- Scaled array A078740 ((3,2)-Stirling2).A090452
Scaled array A078740 ((3,2)-Stirling2).
- Third column (m=4) of array A090452.A090453
Third column (m=4) of array A090452.
- Fourth column (m=5) of array A090452.A090454
Fourth column (m=5) of array A090452.
- Difference between numbers of binary 1's of n and binary 1's of n-th prime.A090455
Difference between numbers of binary 1's of n and binary 1's of n-th prime.
- Primes prime(k) having more binary 1's than k.A090456
Primes prime(k) having more binary 1's than k.
- Primes prime(k) having fewer binary 1's than k.A090457
Primes prime(k) having fewer binary 1's than k.
- Decimal expansion of (3 + sqrt(21))/2.A090458
Decimal expansion of (3 + sqrt(21))/2.
- Duplicate of A090417.A090459
Duplicate of A090417.
- Number of essentially different permutations of the numbers 1 to n such that the sum of adjacent numbers is a square.A090460
Number of essentially different permutations of the numbers 1 to n such that the sum of adjacent numbers is a square.