New properties of a composition of ordinary generating functions for primes

DOI10.1080/09720529.2019.1680142zbMath1483.11046OpenAlexW3009762879MaRDI QIDQ5034970

A. A. Shelupanov, Yuriy V. Shablya, Dmitry V. Kruchinin

Publication date: 21 February 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2019.1680142

zbMATH Keywords

generating functioncompositainteger sequenceprimality criterion

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Special sequences and polynomials (11B83) Factorization; primality (11A51)

Uses Software

• OEIS

Cites Work

• Application of a composition of generating functions for obtaining explicit formulas of polynomials
• Chebyshev polynomials and their some interesting applications
• Explicit formulas and recurrence relations for higher order Eulerian polynomials
• Cryptography made simple
• A primality criterion based on Lucas’ congruence
• Eulerian Polynomials: From Euler’s Time to the Present
• The Little Book of Bigger Primes
• The improvement of initial value closer to the target for Fermat’s factorization algorithm
• Powers in products of terms of Pell's and Pell–Lucas Sequences
• A class of generating functions for a new generalization of Eulerian polynomials with their interpolation functions
• On a divisibility relation for Lucas sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New properties of a composition of ordinary generating functions for primes