This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A318515 a(n) = n AND A032742(n), where AND is bitwise-and (A004198) and A032742 = the largest proper divisor of n. 3
 1, 0, 1, 0, 1, 2, 1, 0, 1, 0, 1, 4, 1, 6, 5, 0, 1, 0, 1, 0, 5, 2, 1, 8, 1, 8, 9, 12, 1, 14, 1, 0, 1, 0, 3, 0, 1, 2, 5, 0, 1, 0, 1, 4, 13, 6, 1, 16, 1, 16, 17, 16, 1, 18, 3, 24, 17, 24, 1, 28, 1, 30, 21, 0, 1, 0, 1, 0, 5, 2, 1, 0, 1, 0, 9, 4, 9, 6, 1, 0, 17, 0, 1, 0, 17, 2, 21, 8, 1, 8, 9, 12, 29, 14, 19, 32, 1, 32, 33, 32, 1, 34, 1, 32, 33 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,6 LINKS Antti Karttunen, Table of n, a(n) for n = 1..65537 FORMULA a(n) = A004198(n, A032742(n)). a(n) = n + A032742(n) - A318514(n) = (n+A032742(n)-A106409(n))/2. PROG (PARI) A032742(n) = if(1==n, n, n/vecmin(factor(n)[, 1])); A318515(n) = bitand(n, A032742(n)); CROSSREFS Cf. A004198, A032742, A060681, A106409, A318508, A318514, A318518. Sequence in context: A174695 A165577 A259776 * A116422 A130161 A115672 Adjacent sequences:  A318512 A318513 A318514 * A318516 A318517 A318518 KEYWORD nonn,base AUTHOR Antti Karttunen, Aug 28 2018 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.

Last modified December 14 07:15 EST 2018. Contains 318090 sequences. (Running on oeis4.)