Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A118740
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A118740 Let L_n be the infinite sequence formed by starting with 1 and repeatedly placing the first digit at the end of the number and adding n to get the next term. Sequence gives number of steps for L_n to enter a cycle, or -1 if no cycle is ever reached. +0
1
1, 6, 1, 4, 3, 3, 8, 3, 1, 2, 1, 2, 1, 4, 2, 1, 1, 2, 1, 24, 6, 13, 5, 6, 6, 9, 2, 25, 1, 6, 1, 5, 1, 1, 1, 2, 22, 3, 1, 52, 5, 1, 16, 21, 2, 19, 10, 11, 18, 32, 9, 12, 1, 2, 1, 3, 2, 3, 55, 9, 3, 18, 2, 3, 2, 2, 1, 3, 8, 58, 1, 2, 3, 3, 3, 2, 2, 3, 81, 35, 2, 3, 2, 2, 13, 2, 2, 3, 4, 2, 3, 3, 2, 19, 2, 2 (list; graph; listen)
OFFSET

1,2

COMMENT

It is conjectured that L_n always reaches a cycle.

EXAMPLE

L_2 enters a cycle of length 9 after 6 steps.

CROSSREFS

Sequence in context: A085677 A074584 A101023 this_sequence A082344 A021865 A068226

Adjacent sequences: A118737 A118738 A118739 this_sequence A118741 A118742 A118743

KEYWORD

base,nonn

AUTHOR

Luc Stevens (lms022(AT)yahoo.com), May 24 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research