A318262 -id:A318262 - cp's OEIS frontend

A318261 a(n) is the odd part of A318262(n).

3, 3, 7, 5, 3, 7, 15, 5, 3, 7, 15, 31, 9, 5, 21, 3, 7, 15, 31, 63, 9, 21, 3, 7, 15, 31, 63, 127, 17, 9, 5, 21, 85, 3, 51, 7, 15, 31, 63, 127, 255, 17, 9, 73, 5, 21, 85, 3, 51, 7, 15, 31, 63, 127, 255, 511, 33, 17, 73, 5, 21, 85, 341, 11, 93, 3, 51, 7, 15, 31

Offset: 1

Graph
List
Refs
Listen
History
Text
Internal format

Peter Luschny, Sep 05 2018

nonn

The odd part of n is the largest odd divisor of n (A000265).

Peter Luschny, Table of n, a(n) for n = 1..1000

Cf. A000265, A318262.

def A318261_list(len):
    count = 0; n = 0; L = []
    while count < len:
        n += 2
        m = power_mod(2, euler_phi(n), n)
        if m.is_power_of(2):
            v = 2^valuation(n, 2)
            L.append(n // v)
            count += 1
    return L
print(A318261_list(70))

cp's OEIS Frontend

A318261 a(n) is the odd part of A318262(n).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Sage