Skip to main
Zenodo home
Communities
My dashboard
Log in Sign up
Integers: Electronic Journal of Combinatorial Number Theory Repository
Published November 5, 2025 | Version v1
Journal article Open

Determinantal Representations of Some Classical Recurrent Sequences

Authors/Creators

  • Goy, Taras
  • Shattuck, Mark

Files

z97.pdf

Files (382.6 kB)

Name Size Download all
z97.pdf
md5:7f6d0b355dcead5140ec53317402034f
382.6 kB Preview Download
138
Views
57
Downloads
Show more details
All versions This version
Views

Total views

138 138
Downloads

Total downloads

57 57
Data volume

Total data volume

25.2 MB 25.2 MB

More info on how stats are collected....

Versions

External resources

Indexed in
  • OpenAIRE

Communities

Details

DOI
10.5281/zenodo.17535257
DOI Badge

DOI

10.5281/zenodo.17535257

Markdown

[![DOI](https://zenodo.org/badge/DOI/10.5281/zenodo.17535257.svg)](https://doi.org/10.5281/zenodo.17535257)

reStructuredText

.. image:: https://zenodo.org/badge/DOI/10.5281/zenodo.17535257.svg
  :target: https://doi.org/10.5281/zenodo.17535257

HTML

<a href="https://doi.org/10.5281/zenodo.17535257"><img src="https://zenodo.org/badge/DOI/10.5281/zenodo.17535257.svg" alt="DOI"></a>

Image URL

https://zenodo.org/badge/DOI/10.5281/zenodo.17535257.svg

Target URL

https://doi.org/10.5281/zenodo.17535257
Resource type
Journal article
Publisher
Zenodo

Rights

License
cc-by-4.0 icon Creative Commons Attribution 4.0 International
The Creative Commons Attribution license allows re-distribution and re-use of a licensed work on the condition that the creator is appropriately credited. Read more

Citation

Export

Technical metadata

Created
November 5, 2025
Modified
November 5, 2025

About

  • About
  • Policies
  • Infrastructure
  • Principles
  • Projects
  • Roadmap
  • Contact

Blog

  • Blog

Support

  • Help
  • FAQ

Developers

  • REST API
  • OAI-PMH

Contribute

  • GitHub
  • Donate

Funded by

Powered by CERN Data Centre & InvenioRDM

  • Status
  • Privacy policy
  • Cookie policy
  • Terms of Use

This site uses cookies. Find out more on how we use cookies