login

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”).

A176168
Length of shortest series s(1..a(n))>0, with s(1)=1 and |s(i+1)-s(i)|=i and no value s(i) repeated, containing all the values 1..n
2
1, 2, 5, 5, 13, 17, 17, 20, 29, 36, 37, 37, 37, 37, 41, 45, 45, 56, 56, 58, 58, 58, 62, 62, 62, 62, 77, 77, 81, 81, 88, 89, 89, 89, 89, 89, 89, 89, 89, 89, 106, 106, 107, 107, 109, 113, 120, 121, 125, 125, 125, 125, 128, 128, 128, 132, 132, 132, 132, 144, 145, 148, 148, 148
OFFSET
1,2
COMMENTS
A series of finite versions of an infinite problem suggested on the Sequence Fans Mailing List
EXAMPLE
a(5)=13 because the shortest series s() containing 1..5 is: 1 2 4 7 3 8 14 21 29 38 28 17 5
CROSSREFS
For encoded series see A176169
Sequence in context: A100953 A112835 A206625 * A308770 A222114 A308845
KEYWORD
nonn
AUTHOR
R. H. Hardin Apr 10 2010
STATUS
approved