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.

Showing 1-3 of 3 results.

A085018 Numbers n such that there is no divisor m of n with mA083752(n) = (n/m)A083752(m).

Original entry on oeis.org

1, 4, 13, 24, 33, 37, 52, 61, 69, 73, 88, 97, 109, 121, 132, 141, 157, 177, 181, 184, 193, 213, 229, 241, 244, 249, 253, 277, 292, 312, 313, 321, 337, 349, 373, 376, 388, 393, 397, 409, 421, 429, 433, 457, 472, 481, 501, 517, 529, 537, 541, 564, 568, 573, 577
Offset: 1

Views

Author

Zak Seidov, Jun 18 2003

Keywords

Comments

Seems to be a subsequence of the positive numbers primitively represented by the binary quadratic form (1, 6, -3) with discriminant 48 (see A244291, A243168). - Peter Luschny, Jun 25 2014

Examples

			A083752(2) = (2/1)*A083752(1), therefore 2 is not in the sequence.
But A083752(4) = 109 and 4*A083752(1) = 1572 and 2*A083752(2) = 1572.
Therefore the equation cannot be solved and 4 is in the sequence.
		

Crossrefs

Programs

  • Mathematica
    (* b = A083752 *) b[n_] := b[n] = For[k = n+1, True, k++, If[IntegerQ[Sqrt[(4k+3n)(4n+3k)]], Return[k]]]; Reap[For[n = 1, n < 600, n++, mm = Most @ Divisors[n]; If[NoneTrue[mm, b[n] == (n/#) b[#] &], Print[n]; Sow[n]]]][[2, 1]] (* Jean-François Alcover, Oct 31 2016 *)
  • Sage
    def is_A085018(n):
        for d in divisors(n):
            if d < n:
                if d*A083752(n) == n*A083752(d):
                    return false
        return true
    filter(is_A085018, (1..577)) # Peter Luschny, Jun 25 2014

Extensions

Edited and extended by Stefan Steinerberger, Jul 30 2007
More terms from Peter Luschny, Jun 25 2014

A085019 a(n) = A083752(A085018(n)).

Original entry on oeis.org

393, 109, 132, 157, 481, 184, 213, 1048, 244, 577, 277, 1833, 312, 681
Offset: 1

Views

Author

Zak Seidov, Jun 18 2003

Keywords

Crossrefs

Extensions

Edited and extended by Stefan Steinerberger, Jul 30 2007

A235188 Integers n of the form square root ((4k + 3j) (4j + 3k)), 0 < j < k.

Original entry on oeis.org

392, 504, 630, 770, 784, 924, 1008, 1092, 1176, 1260, 1274, 1365, 1470, 1512, 1540, 1568, 1680, 1785, 1848, 1890, 1904, 1960, 2016, 2142, 2184, 2261, 2310, 2352, 2394, 2520, 2548, 2660, 2730, 2744, 2772, 2793, 2940, 3024, 3080, 3136, 3150, 3220, 3234, 3276, 3360
Offset: 1

Views

Author

Robert G. Wilson v, Jan 04 2014

Keywords

Comments

Allowing j = 0 or j = k has the effect of introducing all multiples of 7. - Charles R Greathouse IV, Jan 09 2014

Crossrefs

Cf. A083752.

Programs

  • Mathematica
    lst = {}; Do[a = Sqrt[(4k + 3j) (4j + 3k)]; If[ IntegerQ[ a], AppendTo[lst, a]], {j, 2, 1000}, {k, j - 1}]; Take[Union@ lst, 45]
Showing 1-3 of 3 results.