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.

A067589 Numbers k such that A067588(k) is an odd number.

Original entry on oeis.org

1, 5, 7, 15, 35, 51, 57, 77, 117, 145, 155, 187, 247, 287, 301, 345, 425, 477, 495, 551, 651, 715, 737, 805, 925, 1001, 1027, 1107, 1247, 1335, 1365, 1457, 1617, 1717, 1751, 1855, 2035, 2147, 2185, 2301, 2501, 2625, 2667, 2795, 3015, 3151, 3197, 3337
Offset: 1

Views

Author

Naohiro Nomoto, Jan 31 2002

Keywords

Comments

The terms are exactly the odd pentagonal numbers; that is, they are all the odd numbers of the form k*(3*k-1)/2 where k is an integer. - James Sellers, Jun 09 2007
Apparently groups of two odd pentagonal numbers (A000326, A014632) followed by two odd 2nd pentagonal numbers (A005449), which leads to the conjectured generating function x*(x^2+4*x+1)*(x^4-2*x^3+4*x^2-2*x+1)/((x^2+1)^2*(1-x)^3). - R. J. Mathar, Jul 26 2009
Odd generalized pentagonal numbers. - Omar E. Pol, Aug 19 2011
From Peter Bala, Jan 10 2025: (Start)
The sequence terms are the exponents in the expansion of Sum_{n >= 0} x^(2*n+1)/(Product_{k = 1..2*n+1} 1 + x^(2*k+1)) = x + x^5 - x^7 - x^15 + x^35 + x^51 - x^57 - x^77 + + - - ... (follows from Berndt et al., Theorem 3.3). Cf. A193828.
For positive integer m, define b_m(n) = Sum_{k = 1..n} k^(2*m+1)*A000009(k)*A000009(n-k). We conjecture that
i) for odd n, b(n)/ n is an integer
ii) b(2*n)/n is an integer, which is odd iff n is a member of this sequence.
Cf. A067567. (End)

Crossrefs

Programs

  • Mathematica
    With[{nn=50},Sort[Select[Table[(n(3n-1))/2,{n,-nn,nn}],OddQ]]] (* Harvey P. Dale, Feb 16 2014 *)

Formula

Sum_{n>=1} 1/a(n) = Pi/2. - Amiram Eldar, Aug 18 2022

Extensions

Corrected by T. D. Noe, Oct 25 2006