login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A293041 a(n) is the least k such that [mu(k), mu(k+1), ..., mu(k+n-1)] forms a palindrome, where mu = A008683. 0
1, 2, 3, 62, 4, 61, 15, 115, 14, 116, 13, 831, 12, 37173, 597, 457472, 596, 2955661, 595, 6495574, 2456, 6495573, 41227 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

a(n+2) >= a(n) - 1.

a(n) exists: e.g. by the Chinese Remainder Theorem there are arbitrarily long intervals where mu = 0.

a(24) > 10^7.

LINKS

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

Mathematics StackExchange, Is there a Mobius palindrome?

MAPLE

mu:= proc(n) option remember; numtheory:-mobius(n) end proc:

ispali:= proc(L) andmap(i -> (L[i]=L[-i]), [$1..nops(L)/2]) end proc;

f:= proc(n) local k;

  for k from 1 do

    if ispali(map(mu, [$k..k+n-1])) then return k fi

  od;

end proc:

map(f, [$1..30]);

CROSSREFS

Cf. A008683.

Sequence in context: A072875 A093551 A173915 * A284755 A061452 A280582

Adjacent sequences:  A293038 A293039 A293040 * A293042 A293043 A293044

KEYWORD

nonn,more

AUTHOR

Robert Israel, Sep 28 2017

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 19 08:44 EST 2019. Contains 329318 sequences. (Running on oeis4.)