Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A165305
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A165305 Minimum number n, not already present, that permits the cyclic repetition of the path 1,2,3,4,5,6,7 of the digits in the sequence. +0
3
1, 2, 3, 4, 5, 6, 7, 12, 34, 56, 71, 23, 45, 67, 123, 456, 712, 345, 671, 234, 567, 1234, 5671, 2345, 6712, 3456, 7123, 4567, 12345, 67123, 45671, 23456, 71234, 56712, 34567, 123456, 712345, 671234, 567123, 456712, 345671, 234567, 1234567 (list; graph; listen)
OFFSET

1,2

EXAMPLE

Starting from 1,2,3,4,5,6,7 the next number must be 12 because after 1,2,3,4,5,6,7 we shall continue with a 1. But 1 is already in the sequence so we need to add a 2 -> 12. And so on.

CROSSREFS

A165300-A165304, A165306, A165307

Sequence in context: A039952 A129978 A033079 this_sequence A125745 A032990 A060810

Adjacent sequences: A165302 A165303 A165304 this_sequence A165306 A165307 A165308

KEYWORD

easy,nonn,uned

AUTHOR

Paolo P. Lava & Giorgio Balzarotti (ppl(AT)spl.at), Sep 14 2009

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 December 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research