Pell-Padovan tetranacci numbers and their Hadamard product with classical sequences
Helmut Prodinger
TL;DR
This paper introduces a method for efficiently computing generating functions for Pell-Padovan tetranacci numbers and related classical sequences, enabling simultaneous calculation of multiple special cases.
Contribution
It provides a rapid computational approach for generating functions of Pell-Padovan tetranacci numbers and classical sequences, including eight special instances.
Findings
Efficient computation of generating functions for Pell-Padovan tetranacci numbers.
Simultaneous calculation of eight special sequence instances.
Simplified method for related classical recursive sequences.
Abstract
A quick way to compute generating functions related to Pell-Padovan tetranacci numbers and classical sequences of recursions of order two is provided. Eight special instances can be computed at once.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Mathematical Theories and Applications · Advanced Combinatorial Mathematics · Advanced Mathematical Identities