New integer sequences arising from 3-period folding numbers
Journal of integer sequences, Tome 19 (2016) no. 3
Following Pólya's "guess and test" method, we seek to discover 3-period folding numbers analogous to the exhaustive set of 2-period folding numbers discovered by Hilton and Pedersen in 1981. Most of the rows and columns of the 2-period folding numbers are reported in the Online Encyclopedia of Integer Sequences (OEIS) with various other mathematical interpretations. We provide a table of 3-period folding numbers, but it is not exhaustive, as we demonstrate by showing other sets of 3-period folding numbers that are not in the table. We close the paper with an algorithm for finding more sets of 3-period folding numbers and a conjecture about how many such sets exist.
Classification :
11A99, 11B50, 51M15
Keywords: number theory, algorithm, paper-folding, sequence
Keywords: number theory, algorithm, paper-folding, sequence
@article{JIS_2016__19_3_a4,
author = {Nguyen, Quynh and Pedersen, Jean and Vu, Hien T.},
title = {New integer sequences arising from 3-period folding numbers},
journal = {Journal of integer sequences},
year = {2016},
volume = {19},
number = {3},
zbl = {1415.11054},
language = {en},
url = {http://geodesic.mathdoc.fr/item/JIS_2016__19_3_a4/}
}
Nguyen, Quynh; Pedersen, Jean; Vu, Hien T. New integer sequences arising from 3-period folding numbers. Journal of integer sequences, Tome 19 (2016) no. 3. http://geodesic.mathdoc.fr/item/JIS_2016__19_3_a4/