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.

A154777 Numbers of the form x^2 + 2*y^2 with positive integers x and y.

Original entry on oeis.org

3, 6, 9, 11, 12, 17, 18, 19, 22, 24, 27, 33, 34, 36, 38, 41, 43, 44, 48, 51, 54, 57, 59, 66, 67, 68, 72, 73, 75, 76, 81, 82, 83, 86, 88, 89, 96, 97, 99, 102, 107, 108, 113, 114, 118, 121, 123, 129, 131, 132, 134, 136, 137, 139, 144, 146, 147, 150, 152, 153, 162, 163
Offset: 1

Views

Author

M. F. Hasler, Jan 24 2009

Keywords

Comments

Subsequence of A002479 (which allows for x=0 and/or y=0). See there for further references. See A155560 cf for intersection of sequences of type (x^2 + k*y^2).
Also, subsequence of A000408 (with 2*y^2 = y^2 + z^2).
If m and n are terms also n*m is (in particular any power of term is also a term). - Zak Seidov, Nov 30 2011
If m is a term, 2*m is also. - Zak Seidov, Nov 30 2011
Select terms that are multiples of 25: 75, 150, 225, 275, 300, 425, 450, 475, 550, 600, 675, 825, 850, 900, 950, 1025, 1075, 1100, ... Divide them by 25: 3, 6, 9, 11, 12, 17, 18, 19, 22, 24, 27, 33, 34, 36, 38, 41, 43, 44, 48, 51, 54, 57, 59, 66, 67, 68, 72, ... and we get the original sequence. - Zak Seidov, Dec 01 2011
This sequence is closed under multiplication because A002479 is. - Jerzy R Borysowicz, Jun 13 2020

Examples

			a(1) = 3 = 1^2 + 2*1^2 is the least number that can be written as A + 2B where A, B are positive squares.
a(2) = 6 = 2^2 + 2*1^2 is the second smallest number that can be written in this way.
		

Crossrefs

Subsequence of A002479 and hence of A000408.
Cf. A155560, A338432 (triangle version of array), A339047 (multiplicities).

Programs

  • Mathematica
    f[upto_]:=Module[{max=Ceiling[Sqrt[upto-1]]},Select[Union[ First[#]^2+ 2Last[#]^2&/@Tuples[Range[13],{2}]],#<=upto&]]; f[200] (* Harvey P. Dale, Jun 17 2011 *)
  • PARI
    isA154777(n,/* use optional 2nd arg to get other analogous sequences */c=2) = { for( b=1,sqrtint((n-1)\c), issquare(n-c*b^2) & return(1))}
    for( n=1,200, isA154777(n) & print1(n","))

A339048 a(n) = 2*n^2 + 9.

Original entry on oeis.org

9, 11, 17, 27, 41, 59, 81, 107, 137, 171, 209, 251, 297, 347, 401, 459, 521, 587, 657, 731, 809, 891, 977, 1067, 1161, 1259, 1361, 1467, 1577, 1691, 1809, 1931, 2057, 2187, 2321, 2459, 2601, 2747, 2897, 3051, 3209, 3371, 3537, 3707, 3881
Offset: 0

Views

Author

Wolfdieter Lang, Dec 09 2020

Keywords

Comments

Third diagonal sequence of triangle A338432, for n >= 1.

Crossrefs

Programs

Formula

a(n) = 2*n^2 + 9, n >= 0.
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3), for n >= 3.
a(n) = A338432(n + 2, n), for n >= 1 and a(0) = 9.
G.f.: (9 - 16*x + 11*x^2)/(1 - x)^3.
E.g.f.: exp(x)*(9 + 2*x + 2*x^2). - Stefano Spezia, Aug 07 2024

A339047 a(n) gives the multiplicity for A154777(n) representable as x^2 + 2*y^2 with positive integers x and y, for n >= 1.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 3, 2, 1, 2, 1, 2, 1, 1, 2, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 2, 1, 1, 1, 3, 1, 1, 2, 1, 1, 2, 1, 1, 1, 3
Offset: 1

Views

Author

Wolfdieter Lang, Dec 09 2020

Keywords

Examples

			See A338432 for examples.
The pairs [A154777(n), a(n)] begin:
[3, 1], [6, 1], [9, 1], [11, 1], [12, 1], [17, 1], [18, 1], [19, 1], [22, 1], [24, 1], [27, 2], [33, 2], [34, 1], [36, 1], [38, 1], [41, 1], [43, 1], [44, 1], [48, 1], [51, 2], [54, 2], [57, 2], [59, 1], [66, 2], [67, 1], [68, 1], [72, 1], [73, 1], [75, 1], [76, 1], [81, 2], [82, 1], [83, 1], [86, 1], [88, 1], [89, 1], [96, 1], [97, 1], [99, 3], ...
		

Crossrefs

Formula

a(n) gives the number of occurrences of A154777(n) = x^2 + 2*y^2 with positive integers x and y. This is obtained from triangle A338432.
Showing 1-3 of 3 results.