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-13 of 13 results.

A154775 Numbers k such that 13*(6*k)^2 is the average of a twin prime pair.

Original entry on oeis.org

2, 4, 5, 42, 46, 49, 59, 82, 84, 100, 119, 128, 137, 182, 185, 187, 192, 233, 264, 301, 303, 340, 376, 390, 395, 422, 438, 446, 471, 472, 494, 518, 527, 570, 598, 609, 611, 633, 667, 688, 714, 716, 726, 728, 733, 744, 831, 837, 865, 875, 896, 926, 940, 948
Offset: 1

Views

Author

M. F. Hasler, Jan 15 2009

Keywords

Comments

Inspired by Zak Seidov's post to the SeqFan list, cf. link: This yields A154675 as 468 a(n)^2. Indeed, if N/13 is a square, then N=13 k^2 and this can't be the average of a twin prime pair unless k=6m.

Crossrefs

Programs

  • Mathematica
    okQ[n_]:=Module[{av=468n^2},PrimeQ[av-1]&&PrimeQ[av+1]]; Select[Range[1000],okQ] (* Harvey P. Dale, Jan 21 2011 *)
  • PARI
    for(i=1,999, isprime(468*i^2+1) & isprime(468*i^2-1) & print1(i","))

Formula

a(n) = sqrt(A154675(n)/468).

A226599 Numbers which are the sum of two squared primes in exactly four ways (ignoring order).

Original entry on oeis.org

10370, 10730, 11570, 12410, 13130, 19610, 22490, 25010, 31610, 38090, 38930, 39338, 39962, 40970, 41810, 55250, 55970, 59330, 59930, 69530, 70850, 73730, 76850, 77090, 89570, 98090, 98930, 103298, 118898, 125450, 126290, 130730, 135218, 139490
Offset: 1

Views

Author

Henk Koppelaar, Jun 13 2013

Keywords

Comments

It appears that all first differences are divisible by 24. - Zak Seidov, Jun 14 2013

Examples

			10370 = 13^2 + 101^2 = 31^2 + 97^2 = 59^2 + 83^2 = 71^2 + 73^2.
10730 = 11^2 + 103^2 = 23^2 + 101^2 = 53^2 + 89^2 = 67^2 + 79^2.
		

References

  • Stan Wagon, Mathematica in Action, Springer, 2000 (2nd ed.), Ch. 17.5, pp. 375-378.

Crossrefs

Cf. A054735 (restricted to twin primes), A037073, A069496.
Cf. A045636 (sum of two squared primes is a superset).
Cf. A214511 (least number having n representations).
Cf. A225104 (numbers having at least three representations is a superset).
Cf. A226539, A226562 (sums decomposed in exactly two and three ways).

Programs

  • Maple
    Prime2PairsSum := s -> select(x ->`if`(andmap(isprime, x), true, false),
       numtheory:-sum2sqr(s)):
    for n from 2 to 10^6 do
      if nops(Prime2PairsSum(n)) = 4 then print(n, Prime2PairsSum(n)) fi;
    od;
  • Mathematica
    (* Assuming mod(a(n),24) = 2 *) Reap[ For[ k = 2, k <= 2 + 240000, k = k + 24, pr = Select[ PowersRepresentations[k, 2, 2], PrimeQ[#[[1]]] && PrimeQ[#[[2]]] &]; If[Length[pr] == 4 , Print[k]; Sow[k]]]][[2, 1]] (* Jean-François Alcover, Jun 14 2013 *)

Formula

a(n) = p^2 + q^2; p, q are (not necessarily different) primes

A363967 Numbers whose divisors can be partitioned into two disjoint sets whose both sums are squares.

Original entry on oeis.org

1, 3, 9, 22, 27, 30, 40, 63, 66, 70, 81, 88, 90, 94, 115, 119, 120, 138, 153, 156, 170, 171, 174, 184, 189, 190, 198, 210, 214, 217, 232, 264, 265, 270, 280, 282, 310, 318, 322, 323, 343, 345, 357, 360, 364, 376, 382, 385, 399, 400, 414, 416, 462, 468, 472, 495, 497
Offset: 1

Views

Author

Amiram Eldar, Jun 30 2023

Keywords

Comments

If one of the two sets is empty then the term is a number whose sum of divisors is a square (A006532).
If k is a number such that (6*k)^2 is the sum of a twin prime pair (A037073), then (18*k^2)^2 - 1 is a term.
3 is the only prime term.

Examples

			9 is a term since its divisors, {1, 3, 9}, can be partitioned into the two disjoint sets, {1, 3} and {9}, whose sums, 1 + 3 = 4 = 2^2 and 9 = 3^2, are both squares.
		

Crossrefs

Subsequence of A333911.
A006532 is a subsequence.
Similar sequences: A333677, A360694.

Programs

  • Mathematica
    sqQ[n_] := IntegerQ[Sqrt[n]]; q[n_] := Module[{d = Divisors[n], s, p}, s = Total[d]; p = Position[Rest @ CoefficientList[Product[1 + x^i, {i, d}], x], _?(# > 0 &)] // Flatten; AnyTrue[p, sqQ[#] && sqQ[s - #] &]]; Select[Range[500], q]
Previous Showing 11-13 of 13 results.