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

A152259 Union of values: A147568(n) and 2*A147568(n) - 1.

Original entry on oeis.org

3, 5, 9, 11, 13, 21, 25, 35, 37, 43, 45, 69, 73, 85, 89, 131, 133, 139, 141, 163, 165, 171, 173, 261, 265, 277, 281, 325, 329, 341, 345, 515, 517, 523, 525, 547, 549, 555, 557, 643, 645, 651, 653, 675, 677, 683, 685, 1029, 1033, 1045, 1049, 1093, 1097, 1109, 1113, 1285, 1289
Offset: 1

Views

Author

Vladimir Shevelev, Dec 01 2008

Keywords

Comments

Every even N>=6 is a sum of two terms of the sequence.

Crossrefs

Programs

  • Mathematica
    A000695[n_]:= FromDigits[IntegerDigits[n,2], 4];
    Table[(3+(-1)^n)*A000695[Floor[(2*n-2-(-1)^n)/4]] +4+(-1)^n , {n, 202}]//DeleteDuplicates//Sort (* G. C. Greubel, May 22 2023 *)
  • PARI
    a147568(n) = 2*fromdigits(binary(n), 4) + 3;
    lista(nn) = {my(v = vector(2*nn+2), ind = 0); for (n=0, nn, my(x = a147568(n)); v[ind++] = x; v[ind++] = 2*x - 1); vecsort(v,,8);} \\ Michel Marcus, Dec 18 2018

Extensions

More terms from Michel Marcus, Dec 18 2018
Missing term 685 added by G. C. Greubel, May 22 2023

A153401 a(n) is the least positive number such that in the representation of 2n+1, n>=4, as a sum of the form (2*A000695(k)+a(n))+2(2*A000695(l)+a(n)), both of numbers 2*A000695(k)+a(n) and 2*A000695(l)+a(n) are primes.

Original entry on oeis.org

1, 3, 3, 3, 1, 3, 3, 3, 1, 3, 3, 3, 1, 3, 3, 3, 7, 3, 9, 1, 1, 5, 3, 7, 9, 3, 7, 1, 1, 19, 3, 0, 5, 7, 3, 3, 5
Offset: 4

Views

Author

Vladimir Shevelev, Dec 25 2008

Keywords

Comments

For a given c>=3, every odd N>=3c is a unique sum of the form (2*A000695(k)+c) +2(2*A000695(l)+c).

Crossrefs

Showing 1-2 of 2 results.