A092099 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

A092099

Smallest prime between 2^n and 2^(n+1) having a minimal number of 1's in binary representation, A091936(n) - 2^n.

0, 1, 3, 1, 5, 3, 3, 1, 9, 9, 5, 3, 17, 33, 3, 1, 2049, 3, 65, 33, 17, 129, 9, 513, 35, 131073, 32769, 3, 32769, 3, 65, 81, 17, 513, 16385, 8193, 9, 2049, 33554433, 97, 65, 129, 515, 131073, 129, 32769, 5, 21, 1073741825, 8388609, 65, 2097153, 5, 8589934593, 3, 81

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,3

LINKS

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

FORMULA

A091936(n) - A000079(n).

MATHEMATICA

(* First run the program for A091936 to define f[n] *) Join[{0}, Table[ f[n] - 2^n, {n, 2, 56}]] (* Robert G. Wilson v *)

CROSSREFS

Cf. A091936.

Sequence in context: A161946 A013597 A092131 * A096567 A377703 A239626

Adjacent sequences: A092096 A092097 A092098 * A092100 A092101 A092102

KEYWORD

nonn,base

AUTHOR

Robert G. Wilson v, Feb 19 2004

STATUS

approved

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.