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!)
A246956 Numbers a(n) = 2^(n-1) * f(n), where n >= 1 and f(n) is the smallest prime number larger than 2^n (A014210). 6
3, 10, 44, 136, 592, 2144, 8384, 32896, 133376, 527872, 2102272, 8394752, 33624064, 134438912, 536920064, 2147516416, 8591835136, 34360131584, 137444458496, 549759483904, 2199041081344, 8796124479488, 35184409837568, 140737849065472, 562950540623872, 2251800317001728, 9007201200898048, 36028797421617152, 144115191028645888, 576460753914036224, 2305843021024854016, 9223372069067030528 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
The sequence is the "diagonal" - first element in each column - of the triangle of numbers associated with the symmetric representation of sigma(n) when it has two parts, each of width one (see A246955).
LINKS
EXAMPLE
a(4) = 8 * 17 = 136 since 17 is the first prime larger than 16.
MATHEMATICA
f[n_] := Module[{v = 2^n + 1}, While[!PrimeQ[v], v++]; v]
a[n_] := 2^(n - 1) f[n]
Map[a, Range[32]] (* data *)
PROG
(PARI) a(n) = 2^(n-1) * nextprime(2^n+1); \\ Michel Marcus, Sep 23 2014
CROSSREFS
Sequence in context: A179501 A041737 A279105 * A026682 A335635 A096804
KEYWORD
nonn
AUTHOR
Hartmut F. W. Hoft, Sep 08 2014
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 21 01:16 EDT 2024. Contains 372720 sequences. (Running on oeis4.)