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

 

Logo

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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A165500 Maximum length of arithmetic progression starting at n such that each term k has tau(k) = tau(n). 2
1, 2, 3, 2, 5, 3, 7, 4, 2, 5, 11, 3, 13, 7, 6, 2, 17, 3, 19, 5, 7, 11 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Implicitly, we require the difference d of the arithmetic progression to be positive.

a(n) <= n for all n.

LINKS

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

EXAMPLE

For n=4, tau(n)=3 so each term of the arithmetic progression must be the square of a prime. The difference d must be odd for n+d to qualify, in which case n+2d is even and does not qualify; so a(4)=2 is an upper bound.

CROSSREFS

Cf. A165498, A165501, A088430.

Sequence in context: A341676 A139421 A219964 * A341679 A072505 A095163

Adjacent sequences: A165497 A165498 A165499 * A165501 A165502 A165503

KEYWORD

hard,nonn,more

AUTHOR

Hugo van der Sanden, Sep 21 2009, Oct 09 2009

EXTENSIONS

Extended to n=22 (taking advantage of A088430 for n=19) by Hugo van der Sanden, Jun 02 2015

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 28 22:51 EST 2022. Contains 358421 sequences. (Running on oeis4.)