The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 30 06:58 EDT 2024. Contains 372961 sequences. (Running on oeis4.)