OFFSET
1,2
COMMENTS
This sequence works as a filter for sequences related to the prime factorization of odd numbers by matching to any sequence that is obtained as f(2*n - 1), where f(n) is any function that depends only on the prime signature of n (see the index entry for "sequences computed from exponents in ..."). The last line in Crossrefs section lists such sequences that were present in the database as of Nov 11 2016, although some of the matches might be spurious.
LINKS
FORMULA
MATHEMATICA
a[n_] := Times @@ (Prime[Range[Length[f = FactorInteger[2*n - 1]]]]^Sort[f[[;; , 2]], Greater]); a[1] = 1; Array[a, 100] (* Amiram Eldar, Jul 23 2023 *)
PROG
(Scheme)
(Python)
from sympy import factorint
def P(n):
f = factorint(n)
return sorted([f[i] for i in f])
def a046523(n):
x=1
while True:
if P(n) == P(x): return x
else: x+=1
def a(n): return a046523(2*n - 1) # Indranil Ghosh, May 11 2017
(Python)
from math import prod
from sympy import prime, factorint
def A278223(n): return prod(prime(i+1)**e for i, e in enumerate(sorted(factorint((n<<1)-1).values(), reverse=True))) # Chai Wah Wu, Sep 16 2022
CROSSREFS
KEYWORD
nonn
AUTHOR
Antti Karttunen, Nov 16 2016
STATUS
approved