Metadata-Version: 2.1
Name: integerSequence
Version: 0.1.1
Summary: A Package for natively representing and calculating common integer sequences
Home-page: https://github.com/vigilance91/integerSequences-py
Author: Tyler R. Drury
Author-email: that_canadianguy@hotmail.com
Maintainer: Tyler R. Drury
Maintainer-email: that_canadianguy@hotmail.com
License: UNKNOWN
Platform: UNKNOWN
Classifier: Development Status :: 3 - Alpha
Classifier: License :: OSI Approved :: Apache Software License
Classifier: Environment :: Win32 (MS Windows)
Classifier: Environment :: Console
Classifier: Natural Language :: English
Classifier: Operating System :: Microsoft
Classifier: Operating System :: Microsoft :: Windows :: Windows 8
Classifier: Programming Language :: Python
Classifier: Programming Language :: Python :: 3
Classifier: Programming Language :: Python :: 3.4
Classifier: Programming Language :: Python :: 3 :: Only
Classifier: Intended Audience :: Developers
Classifier: Intended Audience :: Education
Classifier: Intended Audience :: End Users/Desktop
Classifier: Intended Audience :: Other Audience
Classifier: Intended Audience :: Science/Research
Classifier: Topic :: Education
Classifier: Topic :: Games/Entertainment
Classifier: Topic :: Scientific/Engineering :: Mathematics
Classifier: Topic :: Software Development :: Libraries
Classifier: Topic :: Software Development :: Libraries :: Python Modules
Classifier: Topic :: Utilities
Description-Content-Type: text/markdown

# Python Integer Sequences

Developed and maintained by Tyler R. Drury,

This project is a pure python package,
allowing users to conveniently represent and generate common integer sequences, including:

* Factorials
* Prime numbers
* Catalan numbers
* Horadam numbers
* Padovan numbers
* Hofstadter numbers
* Collatz numbers
* Pronic numbers
* Lazy Caterer and Cake Numbers
* Geometric numbers(polygonal, polyhedral)

---

## Target Platform

Python 3.6, 64-bit

---

## Use

~~~~
from integerSequence import Horadam
from integerSequence import Fibonacci as fib
from integerSequence import getPrimes

p = getPrimes(1000) #calculate all primes up to 1000
print(p)

h = Horadam(2,3,1,2)    #unnamed Horadam sequence
s = h.series(10)
print(s)

s = fib.series(20)
print(s)

~~~~

---

## Download

Latest compiled python files/wheels can be found on the Python Package Index [here](),
or developers can find the current Source Code at the GitHub repo [here](),
if you wish to contribute.

---

## Primary Developer

* Tyler R. Drury

## Additional Contributors

---

## Related Projects

Similar or related projects for various platforms can also be found here

### Libraries

* [IntegerSequences-cpp]()  a compiled C/C++ library for generating common sequences of integers
* [IntegerSequences-js]()  a Javascript library for generating common sequences of integers, for front-end web browsers use
* [IntegerSequences-php]()  a PHP library for generating common sequences of integers, for back-end server use


---

## Additional Online References and Resources

* The Official [integerSequences-py Reference]()
* The [Online Encyclopaedia of Integer Sequences](https://oeis.org)

---

## Acknowledgements

* [Neil Sloane](http://neilsloane.com/), founder of the Online Encyclopaedia of Integer Sequences

---

