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.

A265160 a(n) = 2^n + prime(n).

Original entry on oeis.org

4, 7, 13, 23, 43, 77, 145, 275, 535, 1053, 2079, 4133, 8233, 16427, 32815, 65589, 131131, 262205, 524355, 1048647, 2097225, 4194383, 8388691, 16777305, 33554529, 67108965, 134217831, 268435563, 536871021, 1073741937, 2147483775, 4294967427, 8589934729
Offset: 1

Views

Author

Vincenzo Librandi, Dec 03 2015

Keywords

Comments

a(n) is odd for n>1. The first few primes in this sequence are 7, 13, 23, 43, 4133, 8233, 16427, 8388691, ... . - Wesley Ivan Hurt, Dec 05 2015

Crossrefs

Programs

  • Magma
    [NthPrime(n) + 2^n: n in [1..40]];
    
  • Maple
    A265160:=n->2^n + ithprime(n): seq(A265160(n), n=1..40); # Wesley Ivan Hurt, Dec 05 2015
  • Mathematica
    Table[2^n + Prime[n], {n, 40}]
  • PARI
    a(n) = 2^n + prime(n); \\ Altug Alkan, Dec 03 2015

Formula

From Wesley Ivan Hurt, Dec 05 2015: (Start)
a(n) = A000079(n) + A000040(n), for n>0.
a(n) = A100484(n) + A111209(n). (End)