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.

A350083 a(n) = (A006935(n) - 1) / ord(2,A006935(n)/2), where ord(k,m) is the multiplicative order of k modulo m.

Original entry on oeis.org

1, 617, 1305, 9339, 225, 5297, 6985, 1549, 174233, 46549, 93701, 66879, 431087, 593887, 1288921, 446275, 43685, 1205, 3361, 2577225, 1313, 430739, 177301, 8541, 13067, 474525, 561301, 84725, 158873, 725725, 3851, 14019, 128861, 1090301, 2529, 430667, 541673
Offset: 1

Views

Author

Jianing Song, Dec 12 2021

Keywords

Comments

List of (2*k-1) / ord(2,k) where k ranges over the odd numbers such that 2^(2*k-1) == 1 (mod k).

Examples

			A006935(2) = 161038, so a(2) = (161038 - 1) / ord(2,161038/2) = 617.
A006935(3) = 215326, so a(3) = (215326 - 1) / ord(2,215326/2) = 1305.
		

Crossrefs

Programs

  • PARI
    list(lim) = my(v=[],d); forstep(k=1, lim, 2, if((2*k-1)%(d=znorder(Mod(2,k)))==0, v=concat(v,(2*k-1)/d))); v \\ gives a(n) for A347906(n) <= lim

Formula

a(n) = (2*A347906(n) - 1) / ord(2,A347906(n)) = (A006935(n) - 1) / A350084(n).