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

A165657 Numerators of A002110 divided by A102647, starting from the second term of both.

Original entry on oeis.org

2, 3, 15, 105, 385, 5005, 17017, 323323, 1062347, 30808063, 434113615, 35336848261, 1448810778701, 33545541876077, 266186053068611, 5426100312552455, 9156001667401012567, 42962777054727828199
Offset: 1

Views

Author

Creighton Dement, Sep 24 2009

Keywords

Crossrefs

Cf. A002110, A102647, A165658, A165659, A165660.

Programs

  • PARI
    a1(n)=prod(i=1, n, prime(i)); b1(n)=prod(i=1, n, prime(n+1)%prime(i));
a(n)=if(n<0, 0, numerator(a1(n)/b1(n))); for(n=1, 20, print1(a(n) ", "))

A165658 Denominators of A002110 divided by A102647, starting from the second term of both.

Original entry on oeis.org

1, 1, 1, 4, 6, 48, 64, 96, 576, 1728, 13824, 165888, 1036800, 9953280, 119439360, 297271296, 134369280000, 222953472000, 75246796800, 32105299968000, 229323571200, 568865783808000000, 125150472437760000, 6129819058176000
Offset: 1

Views

Author

Creighton Dement, Sep 24 2009

Keywords

Crossrefs

Cf. A002110, A102647, A165657, A165659, A165660.

Programs

  • PARI
    a1(n)=prod(i=1, n, prime(i));
b1(n)=prod(i=1, n, prime(n+1)%prime(i));
a(n)=if(n<0, 0, denominator(a1(n)/b1(n)));
for(n=1, 25, print1(a(n) ", "))

A165659 Numerators of A007504 divided by A033955, starting from the second term of A033955.

Original entry on oeis.org

2, 5, 5, 17, 28, 41, 58, 77, 50, 129, 16, 197, 119, 281, 164, 127, 440, 501, 568, 71, 356, 791, 46, 321, 530, 1161, 1264, 457, 1480, 1593, 344, 1851, 284, 2127, 2276, 809, 2584, 2747, 1457, 441, 1633, 1149, 3638, 3831, 1007, 4227, 4438
Offset: 1

Views

Author

Creighton Dement, Sep 24 2009

Keywords

Comments

Conjecture: with the exception of the second term, 2 <= a(n)/A165660(n) < 3.

Crossrefs

Cf. A007504, A033995, A002110, A102647, A165657, A165658, A165660.

Programs

  • PARI
    a1(n)=sum(i=1, n, prime(i));
b1(n)=sum(i=1, n, prime(n+1)%prime(i));
a(n)=if(n<0, 0, numerator(a1(n)/b1(n)));
for(n=1, 50, print1(a(n) ", "))

Extensions

Typo in definition corrected by Creighton Dement, Oct 09 2009
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.