The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A248134 Consider a number x as a concatenation of two integers, a and b: x = concat(a,b). Take their sum and repeat the process deleting the minimum number and adding the previous sum. The sequence lists the numbers that after some iterations reach a sum equal to themselves. 4
 14, 19, 21, 28, 42, 47, 63, 84, 105, 126, 147, 149, 168, 189, 199, 298, 323, 497, 646, 795, 911, 969, 1292, 1499, 1822, 1999, 2087, 2733, 2998, 3089, 3248, 3379, 3644, 4555, 4997, 5411, 5466, 6178, 6377, 6496, 7288, 7995, 8199, 9161, 9267, 9744, 10822, 12356 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS If the number x is rewritten as concat(a,b), the problem is to find a value of y such that x = a*F(y) + b*F(y+1), if a < b, or x = b*F(y) + a*F(y+1), if a > b, where F(y) is a Fibonacci number (see values of x, a, b, y, for 1

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 25 18:25 EDT 2022. Contains 354071 sequences. (Running on oeis4.)