cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

A265852 n such that A261807(n) = n^3 - n.

Original entry on oeis.org

0, 1, 3, 5, 7, 9, 15, 17, 31, 33, 35, 39, 41, 63, 65, 67, 79, 81, 103, 105, 127, 129, 131, 133, 135, 143, 145, 159, 161, 163, 169, 231, 255, 257, 259, 261, 265, 287, 289, 319, 321, 323, 359, 391, 399, 401, 419, 425, 511, 513, 515, 517, 519, 527, 543, 545
Offset: 1

Views

Author

Robert Israel, Dec 16 2015

Keywords

Comments

n such that the base-2 representation of n^3 has a 1 whenever the representation of n has a 1.
All terms after the first are odd.
Contains A083318 and A000225.

Examples

			5 is in the sequence because A261807(5) = 120 = 5^3 - 5.  The base-2 representations of 5 and 5^3 are 101 and 1111101, and every 1 in 101 corresponds to a 1 in 1111101.
		

Crossrefs

Cf. A261807.

Programs

  • Maple
    select(t -> Bits[Xor](t,t^3) = t^3 - t, [$0..10000]);
  • PARI
    for(n=0, 1e3, if(bitxor(n, n^3) == n^3-n, print1(n, ", "))) \\ Altug Alkan, Dec 16 2015
Showing 1-1 of 1 results.