A323975 - OEIS

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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A323975

a(n) sets a new record for the Lychrel number a(n) of 'Reverse and Add' steps, needed to reach a Lychrel number m < a(n) (i.e., its seed).

195, 295, 4799, 10653, 10821, 14995, 105985, 1005523, 1008927, 1009413, 1029983

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

Records in A323976.

Similar to the number of steps needed to reach a palindrome in the Reverse and Add! trajectories (see A065198 and A065199), the number of steps needed for a Lychrel number to reach the trajectory of its seed is relatively small.

LINKS

Table of n, a(n) for n=1..11.

CROSSREFS

Cf. A065198, A065199, A323976.

Sequence in context: A336333 A351803 A080394 * A055970 A158225 A080913

Adjacent sequences: A323972 A323973 A323974 * A323976 A323977 A323978

KEYWORD

nonn,base,more

AUTHOR

A.H.M. Smeets, Feb 10 2019

STATUS

approved