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-3 of 3 results.

A190150 A190149 converted to base 10.

Original entry on oeis.org

18, 34, 38, 50, 66, 68, 70, 74, 78, 82, 98, 102, 114, 130, 132, 134, 138, 140, 142, 146, 150, 154, 158, 162, 166, 178, 194, 196, 198, 202, 206, 210, 226, 230, 242, 258, 260, 262, 264, 266, 268, 270, 274, 276, 278, 282, 284, 286, 290, 294, 298, 302, 306, 310, 314, 318, 322, 324, 326, 330, 334, 338, 354, 358, 370, 386, 388, 390, 394, 396, 398, 402, 406
Offset: 1

Views

Author

N. J. A. Sloane, May 05 2011

Keywords

Crossrefs

A190151 A190149 converted to base 10 and halved.

Original entry on oeis.org

9, 17, 19, 25, 33, 34, 35, 37, 39, 41, 49, 51, 57, 65, 66, 67, 69, 70, 71, 73, 75, 77, 79, 81, 83, 89, 97, 98, 99, 101, 103, 105, 113, 115, 121, 129, 130, 131, 132, 133, 134, 135, 137, 138, 139, 141, 142, 143, 145, 147, 149, 151, 153, 155, 157, 159, 161, 162, 163, 165, 167, 169, 177, 179, 185, 193, 194, 195, 197, 198, 199, 201, 203, 205, 207, 209, 211
Offset: 1

Views

Author

N. J. A. Sloane, May 05 2011

Keywords

Comments

Take the even numbers n such that in base 2 lunar arithmetic, the sum of the divisors of n is not of the form 2^k-1, and divide them (in ordinary arithmetic) by 2 (cf. A190149, A190150)

Crossrefs

A188548 The sum of the divisors of n in base-2 lunar arithmetic.

Original entry on oeis.org

1, 11, 11, 111, 101, 111, 111, 1111, 1001, 1111, 1011, 1111, 1101, 1111, 1111, 11111, 10001, 11011, 10011, 11111, 10101, 11111, 10111, 11111, 11001, 11111, 11011, 11111, 11101, 11111, 11111, 111111, 100001, 110011, 100011, 111111, 100101, 110111, 100111, 111111, 101001, 111111, 101011, 111111, 101101, 111111, 101111, 111111, 110001, 111011, 110011, 111111
Offset: 1

Views

Author

N. J. A. Sloane, Apr 04 2011

Keywords

Comments

More precisely, in base-2 lunar arithmetic, the lunar sum of the lunar divisors of the n-th nonzero binary number.
Theorem: a(n) = binary representation of n iff n is odd.

Examples

			The 4th binary number is 100 which has lunar divisors 1, 10, 100, whose lunar sum is 111, so a(4)=111.
The 5th binary number is 101 which has lunar divisors 1 and 101, whose lunar sum is 101, so a(5)=101.
It might be tempting to conjecture that if n is even then a(n) = 111...111, but a(18)=11011 shows that this is false (see A190149).
		

Crossrefs

Cf. A067399 (number of divisors), A190149, A190632.
Showing 1-3 of 3 results.