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.

A302097 Number of odd prime factors (with multiplicity) of generalized Fermat number 13^(2^n) + 1.

Original entry on oeis.org

1, 2, 1, 1, 3, 4, 4, 3
Offset: 0

Views

Author

Jeppe Stig Nielsen, Apr 01 2018

Keywords

Comments

a(8) >= 6. - Chai Wah Wu, Dec 09 2019

Examples

			b(n) = (13^(2^n) + 1)/2.
Complete factorizations:
b(0) = 7
b(1) = 5*17
b(2) = 14281
b(3) = 407865361
b(4) = 2657*441281*283763713
b(5) = 193*1601*10433*68675120456139881482562689
b(6) = 257*3230593*36713826768408543617*3215877717636198473712500018174097551256193
b(7) = 96769*2940673*P131
		

Crossrefs

Programs

  • PARI
    a(n) = bigomega((13^(2^n)+1)/2)

A302098 Number of prime factors (with multiplicity) of generalized Fermat number 14^(2^n) + 1.

Original entry on oeis.org

2, 1, 2, 3, 2, 4, 2, 3
Offset: 0

Views

Author

Jeppe Stig Nielsen, Apr 01 2018

Keywords

Comments

a(8) >= 5. - Chai Wah Wu, Dec 09 2019

Examples

			b(n) = 14^(2^n) + 1
Complete factorizations:
b(0) = 3*5
b(1) = 197
b(2) = 41*937
b(3) = 17*5393*16097
b(4) = 193*11284732320255809
b(5) = 7489*1204905857*1667461121*315256811699009
b(6) = 8633886977*P64
b(7) = 257*100497382788383295179961898289105815085380571534081*P95
		

Crossrefs

Programs

  • PARI
    a(n) = bigomega(14^(2^n)+1)

Formula

a(n) = A001222(A152587(n)).
Showing 1-2 of 2 results.