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

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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A213542 a(n) = k AND k^k, where k=2*n+1, AND is the bitwise AND operator. 2
 1, 3, 5, 7, 9, 3, 13, 15, 17, 3, 5, 7, 25, 3, 13, 31, 33, 35, 5, 7, 41, 35, 13, 15, 49, 35, 37, 7, 57, 35, 45, 63, 65, 67, 69, 7, 9, 3, 13, 15, 81, 67, 5, 7, 25, 3, 77, 31, 97, 35, 5, 7, 41, 99, 77, 15, 113, 35, 37, 7, 57, 99, 109, 127, 129, 131, 133, 7, 137, 131 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..10000 MAPLE a:= proc(n) local i, k, m, r;       k:= 2*n+1;       m:= k &^ k mod (2^(1+ilog2(k)));       r:= 0;       for i from 0 while (m>0 or k>0) do         r:= r +2^i* irem(m, 2, 'm') *irem(k, 2, 'k')       od; r     end: seq(a(n), n=0..100);  # Alois P. Heinz, Jun 21 2012 MATHEMATICA Table[BitAnd[n, n^n], {n, 1, 141, 2}] (* Harvey P. Dale, Nov 26 2014 *) PROG (Python) print([k**k & k for k in range(1, 222, 2)]) CROSSREFS Cf. A213541. Sequence in context: A163125 A167047 A065271 * A029657 A122641 A140977 Adjacent sequences:  A213539 A213540 A213541 * A213543 A213544 A213545 KEYWORD nonn,base,easy,look,less AUTHOR Alex Ratushnyak, Jun 14 2012 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 3 21:17 EST 2021. Contains 349468 sequences. (Running on oeis4.)