login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A260594 a(n) is the least k such that A260590(k) = A260593(n). 1
1, 2, 3, 5, 13, 15, 19, 23, 35, 45, 51, 55, 63, 77, 79, 83, 95, 115, 119, 125, 141, 143, 179, 255, 319, 335, 351, 435, 463, 495, 527, 653, 791, 819, 847, 909, 1023, 1143, 1699, 1715, 2127, 2295, 3191, 3197, 3443, 3639, 3763, 3981, 5043, 6199, 6719, 7519, 8845 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

This is the index corresponding to, or responsible for, A260593.

LINKS

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

EXAMPLE

13 is the least k such that A260590(k) = 59 = A260593(5), so a(5) = 13.

MATHEMATICA

msa[n_] := If[ OddQ@ n, (3n + 1)/2, n/2]; f[n_] := Block[{k = 2n + 1}, Length@ NestWhileList[ msa@# &, k, # >= k &] - 1]; k = 1; lst = lsu = {}; While[k < 10000001, a = f@ k; If[ !MemberQ[lst, a], AppendTo[lst, a]; AppendTo[lsu, k]]; k++]; lsu

CROSSREFS

Cf. A260590, A260593.

Sequence in context: A145343 A058592 A268509 * A228940 A045311 A045312

Adjacent sequences:  A260591 A260592 A260593 * A260595 A260596 A260597

KEYWORD

nonn,easy

AUTHOR

Joseph K. Horn and Robert G. Wilson v, Aug 30 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 19 20:41 EST 2020. Contains 331066 sequences. (Running on oeis4.)