login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A162955 a(1)=1. a(n) = the smallest integer >a(n-1) such that both a(n) and the number of divisors of a(n) contain the same number of 1's in their binary representations as n has when written in binary. 0
1, 2, 9, 128, 132, 160, 448, 32768, 32769, 32772, 32960, 33024, 33088, 33344, 33552, 2147483648, 2147483650, 2147483652, 2147483840, 2147483904, 2147483968, 2147484224, 2147484240, 2147484672, 2147484736, 2147485760, 2147485968 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Where n is a power of 2, a(n) equals an entry of A058891. [From R. J. Mathar, Jul 30 2009]

LINKS

Table of n, a(n) for n=1..27.

CROSSREFS

A162952, A162954

Sequence in context: A165327 A090242 A047684 * A197314 A295331 A064448

Adjacent sequences:  A162952 A162953 A162954 * A162956 A162957 A162958

KEYWORD

base,nonn

AUTHOR

Leroy Quet, Jul 18 2009

EXTENSIONS

Extended by R. J. Mathar, Jul 30 2009

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 16:26 EDT 2019. Contains 322430 sequences. (Running on oeis4.)