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

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A165494 Iterations of k -> k+tau(k) from 2(2n-1)^2 until result not divisible by 4 2
2, 3, 3, 3, 2, 3, 7, 2, 3, 6, 2, 9, 3, 2, 10, 3, 2, 2, 5, 7, 3, 4, 7, 10, 5, 5, 10, 8, 2, 7, 3, 8, 7, 4, 9, 36, 13, 9, 2, 6, 7, 5, 2, 2, 9, 4, 30, 2, 16, 4, 6, 6, 4, 11, 24, 16, 11, 9, 3, 11, 15, 2, 9, 10, 2, 26, 2, 10, 3, 3, 4, 13, 11, 5, 12, 3, 7, 17, 21, 17, 17, 12, 5, 4, 3, 8, 19, 9, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

This sequence and A165495 explore a critical aspect of the behavior of A064491.

LINKS

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

EXAMPLE

For a(2) we start at 2.3^2=18; 18+tau(18)=24; 24+tau(24)=32; 32+tau(32)=38, which is not divisible by 4, so a(2)=3 for the 3 iterations needed.

CROSSREFS

Cf. A064491, A165495

Sequence in context: A080748 A084966 A224748 * A204916 A110049 A246577

Adjacent sequences:  A165491 A165492 A165493 * A165495 A165496 A165497

KEYWORD

easy,nonn

AUTHOR

Hugo van der Sanden, Sep 21 2009

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified November 18 09:17 EST 2017. Contains 294879 sequences.