cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Previous Showing 11-17 of 17 results.

A161753 Squares of nonprime numbers A141468.

Original entry on oeis.org

0, 1, 16, 36, 64, 81, 100, 144, 196, 225, 256, 324, 400, 441, 484, 576, 625, 676, 729, 784, 900, 1024, 1089, 1156, 1225, 1296, 1444, 1521, 1600, 1764, 1936, 2025, 2116, 2304, 2401, 2500, 2601, 2704, 2916, 3025, 3136, 3249, 3364, 3600, 3844, 3969, 4096
Offset: 1

Views

Author

Juri-Stepan Gerasimov, Jun 18 2009

Keywords

Comments

Essentially the same as A062312: a(1)=0, a(n)=A062312(n-1) for n>=2. - R. J. Mathar, Sep 11 2012

Examples

			0=0^2, 1=1^2, 16=4^2, 36=6^2, etc.
		

Crossrefs

Programs

  • Mathematica
    With[{nn=100},Complement[Range[0,nn],Prime[Range[PrimePi[nn]]]]^2] (* Harvey P. Dale, Jul 04 2013 *)

Extensions

Corrected and edited by Omar E. Pol, Jun 29 2009

A335437 Numbers k with a partition into two distinct parts (s,t) such that k | s*t.

Original entry on oeis.org

9, 16, 18, 25, 27, 32, 36, 45, 48, 49, 50, 54, 63, 64, 72, 75, 80, 81, 90, 96, 98, 99, 100, 108, 112, 117, 121, 125, 126, 128, 135, 144, 147, 150, 153, 160, 162, 169, 171, 175, 176, 180, 189, 192, 196, 198, 200, 207, 208, 216, 224, 225, 234, 240, 242, 243, 245, 250, 252, 256
Offset: 1

Views

Author

Wesley Ivan Hurt, Jun 10 2020

Keywords

Comments

All values of this sequence are nonsquarefree (A013929).
From Peter Munn, Nov 23 2020: (Start)
Numbers whose square part is greater than 4. [Proof follows from s and t having to be multiples of A019554(k), the smallest number whose square is divisible by k.]
Compare with A116451, numbers whose odd part is greater than 3. The self-inverse function A225546(.) maps the members of either one of these sets 1:1 onto the other set.
Compare with A028983, numbers whose squarefree part is greater than 2.
(End)
The asymptotic density of this sequence is 1 - 15/(2*Pi^2). - Amiram Eldar, Mar 08 2021
From Bernard Schott, Jan 09 2022: (Start)
Numbers of the form u*m^2, for u >= 1 and m >= 3 (union of first 2 comments).
A geometric application: in trapezoid ABCD, with AB // CD, the diagonals intersect at E. If the area of triangle ABE is u and the area of triangle CDE is v, with u>v, then the area of trapezoid ABCD is w = u + v + 2*sqrt(u*v); in this case, u, v, w are integer solutions iff (u,v,w) = (k*s^2,k*t^2,k*(s+t)^2), with s>t and k positives; hence, w is a term of this sequence (see IMTS link). (End)

Examples

			16 is in the sequence since it has a partition into two distinct parts (12,4), such that 16 | 12*4 = 48.
		

References

  • S. Dinh, The Hard Mathematical Olympiad Problems And Their Solutions, AuthorHouse, 2011, Problem 1 of International Mathematical Talent Search, round 7, page 285.

Crossrefs

Complement of A133466 within A013929.
A038838, A046101, A062312\{1}, A195085 are subsequences.
Related to A116451 via A225546.

Programs

  • Mathematica
    Table[If[Sum[(1 - Ceiling[(i*(n - i))/n] + Floor[(i*(n - i))/n]), {i, Floor[(n - 1)/2]}] > 0, n, {}], {n, 300}] // Flatten
    f[p_, e_] := p^(2*Floor[e/2]); sqpart[n_] := Times @@ f @@@ FactorInteger[n]; Select[Range[256], sqpart[#] > 4 &] (* Amiram Eldar, Mar 08 2021 *)

A377817 Numbers that have more than one even exponent in their prime factorization.

Original entry on oeis.org

36, 100, 144, 180, 196, 225, 252, 300, 324, 396, 400, 441, 450, 468, 484, 576, 588, 612, 676, 684, 700, 720, 784, 828, 882, 900, 980, 1008, 1044, 1089, 1100, 1116, 1156, 1200, 1225, 1260, 1296, 1300, 1332, 1444, 1452, 1476, 1521, 1548, 1575, 1584, 1600, 1620, 1692, 1700, 1764, 1800
Offset: 1

Views

Author

Amiram Eldar, Nov 09 2024

Keywords

Comments

Subsequence of A072413 and differs from it by not having the terms 216, 1000, 1080, 1512, ... .
Each term can be represented in a unique way as m * k^2, where m is an exponentially odd number (A268335) and k is a composite number that is coprime to m.
Numbers k such that A350388(k) is a square of a composite number (A062312 \ {1}).
The asymptotic density of this sequence is 1 - Product_{p prime} (1 - 1/(p*(p+1))) * (1 + Sum_{p prime} 1/(p^2+p-1)) = 0.032993560887093165933... .

Crossrefs

Complement of the union of A268335 and A377816.
Subsequence of A072413.

Programs

  • Mathematica
    Select[Range[1800], Count[FactorInteger[#][[;; , 2]], _?EvenQ] > 1 &]
  • PARI
    is(k) = if(k == 1, 0, my(e = factor(k)[, 2]); #select(x -> !(x%2), e) > 1);

A276494 Decimal expansion of the sum of the alternating series of reciprocals of squares of composite numbers.

Original entry on oeis.org

0, 4, 3, 9, 0, 8, 9, 6, 3, 3, 5, 1, 3, 0, 8
Offset: 1

Views

Author

Terry D. Grant, Sep 05 2016

Keywords

Comments

From Jon E. Schoenfield, Feb 02 2018: (Start)
Let S(j) be the partial sum through the j-th term of the alternating series, i.e., S(j) = -Sum_{m=1..j} (-1)^m/A002808(m)^2. The sequence of real values S(2*i-1) for i >= 1, i.e., of partial sums 1/16, 1/16 - 1/36 + 1/64, 1/16 - 1/36 + 1/64 - 1/81 + 1/100, ... (each of which ends with a positive term) will approach the limit from above, while the sequence of real values S(2*i) for i >= 1, i.e., of partial sums 1/16 - 1/36, 1/16 - 1/36 + 1/64 - 1/81, 1/16 - 1/36 + 1/64 - 1/81 + 1/100 - 1/144, ... (each of which ends with a negative term) will approach the limit from below. Let S'(j) = (S(j-1) + S(j))/2; equivalently, S'(j) = -(Sum_{m=1..j-1} (-1)^m/A002808(m)^2 + (1/2)*(-1)^j/A002808(j)^2), so S'(j) can be viewed as an adjusted version of S(j), adjusted by using only half of the final term of S(j). At large values of j, successive values of S'(j) will fluctuate very little compared to the differences between successive values of S(j), because the averaging of successive values of S(j), which are above the limit at each odd value of j and below the limit by very nearly the same amount at each even value of j, causes the values of S'(j) to trace a path midway between that traced by the S(j) values for odd j and those for even j.
Moreover, similar to the situation at A275712, it can be verified that the values of S'(j) themselves fall into three sharply distinct real-valued subsequences: one that converges toward the limit from above and consists of those values where both j and the j-th composite number (i.e., the square root of the reciprocal of the last term in S(j)) are even; one that converges toward the limit from below and consists of those values where j is odd and the j-th composite number is even; and one that stays very near the middle, converging even more rapidly toward the limit, and consisting of all those values where the j-th composite number is odd (regardless of the parity of j). The values in this last subsequence converge very rapidly; see the table in the Example section, which lists values of S'(c_k) where c_k is the smallest odd composite number > 2^k. (End)

Examples

			Equals 0.04390896...
From _Jon E. Schoenfield_, Feb 02 2018: (Start)
Let S'(j) = -(Sum_{m=1..j-1} (-1)^m/A002808(m)^2 + (1/2)*(-1)^j/A002808(j)^2) and let c_k be the smallest odd composite > 2^k; S'(c_k) quickly converges to a limit, as illustrated below:
   k       c_k              S'(c_k)
  ==  ========  ===============================
   3         9  0.04417438271604938271604938...
   4        21  0.04390073853615520282186948...
   5        33  0.04390758368090798391978693...
   6        65  0.04390888269964319809070094...
   7       129  0.04390902395888932501501797...
   8       259  0.04390896620540588616012725...
   9       513  0.04390896281303069589885533...
  10      1025  0.04390896330786777379414334...
  11      2049  0.04390896335161701542401577...
  12      4097  0.04390896335102793828470954...
  13      8193  0.04390896335127457473079624...
  14     16385  0.04390896335131185998890588...
  15     32769  0.04390896335130880417881285...
  16     65541  0.04390896335130852088789156...
  17    131073  0.04390896335130852182995244...
  18    262145  0.04390896335130852702777625...
  19    524289  0.04390896335130852688659318...
  20   1048577  0.04390896335130852691520992...
  21   2097153  0.04390896335130852691785136...
  22   4194305  0.04390896335130852691786707...
  23   8388609  0.04390896335130852691787563...
  24  16777217  0.04390896335130852691787421...
  25  33554433  0.04390896335130852691787435...
  ...
Extending this several steps farther, it becomes apparent that the limit is 0.04390896335130852691787434869606... (End)
		

Crossrefs

Cf. A002162 (of natural numbers), A072691 (of natural numbers squared), A078437 (of primes), A242301 (of primes squared), A269229 (of composite numbers), A275110 (of composite numbers with distinct prime factors), A275712 (of nonprime numbers).
Cf. A275712.

Programs

  • Sage
    compositessq = (i for i in NN if i>3 and not i.is_prime())
    s = RLF(0); s
    RealField(110)(s)
    for i in range(0, 50000000): s += (-1)^i / next(compositessq)^2
    print(s)

Formula

Sum_{k>=1} (-1)^(k+1)/A062312(k+1) = 1/16 - 1/36 + 1/64 - 1/81...
Sum_{k>=1} (-1)^(k+1)/((A002808(k))^2) = 1/(4^2) - 1/(6^2) + 1/(8^2) - 1/(9^2)...

Extensions

a(9)-a(15) from Robert Price, Nov 14 2016

A132637 Composite number C(n) raised to power C(n).

Original entry on oeis.org

256, 46656, 16777216, 387420489, 10000000000, 8916100448256, 11112006825558016, 437893890380859375, 18446744073709551616, 39346408075296537575424, 104857600000000000000000000, 5842587018385982521381124421, 341427877364219557396646723584
Offset: 1

Views

Author

Omar E. Pol, Aug 24 2007

Keywords

Crossrefs

Programs

  • Mathematica
    With[{nn=25},#^#&/@Complement[Range[2,nn],Prime[Range[PrimePi[nn]]]]] (* Harvey P. Dale, Aug 21 2011 *)

Formula

From Amiram Eldar, Nov 18 2020: (Start)
a(n) = A002808(n)^A002808(n).
1 + Sum_{n>=1} 1/a(n) = A094724. (End)

Extensions

More terms from Harvey P. Dale, Aug 21 2011

A246447 The odd primes squared plus 1 and the composites squared minus 1.

Original entry on oeis.org

10, 15, 26, 35, 50, 63, 80, 99, 122, 143, 170, 195, 224, 255, 290, 323, 362, 399, 440, 483, 530, 575, 624, 675, 728, 783, 842, 899, 962, 1023, 1088, 1155, 1224, 1295, 1370, 1443, 1520, 1599, 1682, 1763, 1850, 1935, 2024, 2115, 2210, 2303, 2400, 2499, 2600
Offset: 1

Views

Author

Leo Depuydt, Aug 26 2014

Keywords

Comments

The odd primes squared plus 1 and the nonprimes squared minus 1 are the numerators or denominators of an infinite product converging to 1 whose denominators or numerators, conversely, are the squares of said numbers, that is, (p^2+1/p^2)*(q^2-1)/q^2)..., where p is an odd prime and q is a nonprime.
Union of A066872 and (A062312 - 1) with 0 and 5 removed. - Robert Israel, Aug 26 2014

Crossrefs

Programs

  • PARI
    lista(nn) = {for (n=3, nn, if (isprime(n), print1(n^2+1, ", "), print1(n^2-1, ", ")););} \\ Michel Marcus, Aug 26 2014
    
  • Python
    for n in range(3,10**3):
      if isprime(n):
        print(n**2+1,end=', ')
      else:
        print(n**2-1,end=', ') # Derek Orr, Sep 19 2014

Extensions

More terms from Michel Marcus, Aug 26 2014

A326709 Squares of composites such that beta(m) = (tau(m) - 3)/2 where beta(m) = A220136(m) is the number of Brazilian representations of m and tau(m) = A000005(m) is the number of divisors of m.

Original entry on oeis.org

16, 36, 64, 81, 100, 144, 196, 225, 256, 324, 441, 484, 576, 625, 676, 729, 784, 900, 1024, 1089, 1156, 1225, 1296, 1444, 1764, 1936, 2025, 2116, 2304, 2500, 2601, 2704, 2916, 3025, 3136, 3249, 3364, 3600, 3844, 3969, 4096, 4225, 4356, 4624, 4761, 4900, 5184, 5476, 5625
Offset: 1

Views

Author

Bernard Schott, Aug 29 2019

Keywords

Comments

This sequence is the second subsequence of A326707: squares of composites which have no Brazilian representation with three digits or more.
As tau(m) = 2 * beta(m) + 3, the number of divisors of these squares of composites m is odd with tau(m) >= 5.
The corresponding composites are: 4, 6, 8, 9, 10, 12, 14, 15, 16, 18, 21, 22, 24, 25, 26, 27, 28, 30, 32, 33, 34, 35, 36, 38, 42, ...

Examples

			a(1) = 16: tau(16) = 5 and beta(16) = 1 with 16 = 4^2 = 22_7.
a(3) = 64: tau(64) = 7 and beta(64) = 2 with 64 = 8^2 = 44_15 = 22_31.
a(5) = 100: tau(100) = 9 and beta(100) = 3 with 100 = 10^2 = 55_19 = 44_24 = 22_49.
		

Crossrefs

Subsequence of A000290.
Intersection of A062312 and A326707.
Cf. A326707 = A326708 Union {this sequence} with empty intersection.
Cf. A048691 (number of divisors of n^2).
Cf. A000005 (tau), A220136 (beta).

Programs

  • Mathematica
    brazQ[n_, b_] := Length@Union@IntegerDigits[n, b] == 1; beta[n_] := Sum[Boole @ brazQ[n, b], {b, 2, n - 2}]; aQ[n_] := beta[n] == (DivisorSigma[0, n] - 3)/2; Select[Select[Range[75], CompositeQ]^2, aQ] (* Amiram Eldar, Sep 06 2019 *)
Previous Showing 11-17 of 17 results.