|
|
A286251
|
|
Compound filter: a(n) = P(A001511(1+n), A046523(n)), where P(n,k) is sequence A000027 used as a pairing function.
|
|
7
|
|
|
3, 2, 9, 7, 5, 16, 14, 29, 12, 16, 9, 67, 5, 16, 50, 121, 5, 67, 9, 67, 23, 16, 14, 277, 12, 16, 48, 67, 5, 436, 27, 497, 23, 16, 31, 631, 5, 16, 40, 277, 5, 436, 9, 67, 80, 16, 20, 1129, 12, 67, 31, 67, 5, 277, 40, 277, 23, 16, 9, 1771, 5, 16, 160, 2017, 23, 436, 9, 67, 23, 436, 14, 2557, 5, 16, 94, 67, 23, 436, 20, 1129, 138, 16, 9, 1771, 23, 16, 40, 277, 5
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
FORMULA
|
|
|
PROG
|
(PARI)
A046523(n) = { my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]); }; \\ This function from Charles R Greathouse IV, Aug 17 2011
for(n=1, 10000, write("b286251.txt", n, " ", A286251(n)));
(Python)
from sympy import factorint
def a001511(n): return 2 + bin(n - 1)[2:].count("1") - bin(n)[2:].count("1")
def T(n, m): return ((n + m)**2 - n - 3*m + 2)/2
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 T(a001511(n + 1), a046523(n)) # Indranil Ghosh, May 07 2017
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|