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

On the Additive Uniqueness of Generalized Nonagonal Numbers for Multiplicative Functions

Authors/Creators

  • Park, Poo-Sung

Files

z99.pdf

Files (278.6 kB)

Name Size Download all
z99.pdf
md5:53c277f91008c621055942c288358c6b
278.6 kB Preview Download
35
Views
20
Downloads
Show more details
All versions This version
Views

Total views

35 35
Downloads

Total downloads

20 20
Data volume

Total data volume

5.6 MB 5.6 MB

More info on how stats are collected....

Versions

External resources

Indexed in
  • OpenAIRE

Communities

Details

DOI
10.5281/zenodo.17535282
DOI Badge

DOI

10.5281/zenodo.17535282

Markdown

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

reStructuredText

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

HTML

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

Image URL

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

Target URL

https://doi.org/10.5281/zenodo.17535282
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