Given a number
9$"> with digits
, let us
define a
Fibonacci-like sequence where
and
for
2$">. If the number
appear in the sequence
of the
's then
is called
Gilda number.
For example, starting with n=152 we have the sequence |1-5-2|=6, 1+5+2=8, then
14, 22, 36, 58, 94, and finally 152.
The first Gilda numbers are
29, 49, 78, 110, 152, 220, 314, 330, 364, 440, 550, 628, 660, 683, 770, 880, 990, 997 more terms
Pictorial representation of remainders (mod 2, 3, ...,11) frequency. For a table of values and more details
click here
A graph displaying how many Gilda numbers are multiples of the primes
p from 2 to 71. In black the ideal line 1/
p.