A046960 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A046960

Bessel function J_0(n) is a monotonically decreasing positive sequence.

1, 2, 6, 12, 21, 37, 40, 84, 128, 172, 882, 1592, 2302, 3012, 3722, 4432, 5142, 5852, 6562, 7272, 7982, 8692, 9402, 10112, 10822, 11532, 12242, 12952, 13662, 14372, 15082, 15792, 16502, 17212, 17922, 18632, 19342, 20052, 20762, 21472

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,2

LINKS

Table of n, a(n) for n=0..39.

Index entries for sequences related to Bessel functions or polynomials

FORMULA

Conjectures from Chai Wah Wu, Mar 05 2021: (Start)

a(n) = 2*a(n-1) - a(n-2) for n > 10.

G.f.: (666*x^10 + 41*x^7 - 13*x^6 + 7*x^5 + 3*x^4 + 2*x^3 + 3*x^2 + 1)/(x - 1)^2. (End)

CROSSREFS

Cf. A046961, A046962, A046963.