Edge Rewrite
// HTMLRewriter · presentation

This page was redesigned at the edge.

Cloudflare fetched the original article and streamed it through HTMLRewriter to apply an entirely new visual system without rebuilding the source page.

// request.cf · coarse context

A page that knows where it met you.

Only coarse request metadata is shown. This demo does not display or persist visitor IP addresses.

Country
US
Cloudflare location
CMH
Connection
HTTP/2
Language
Not provided

Ray ID: a2280e3eeea4addf

Jump to content

Padovan polynomials

From Wikipedia, the free encyclopedia

In mathematics, Padovan polynomials are a generalization of Padovan sequence numbers. These polynomials are defined by:[1]

The first few Padovan polynomials are:

The Padovan numbers are recovered by evaluating the polynomials Pn−3(x) at x = 1.

Evaluating Pn−3(x) at x = 2 gives the nth Fibonacci number plus (−1)n. (sequence A008346 in the OEIS)

The ordinary generating function for the sequence is

See also

[edit]


References

[edit]
  1. "PADOVAN POLYNOMIALS MATRIX". p. 4.