|
| |
| |
|
|
|
1, 1, 2, 1, 6, 1, 6, 1, 30, 1, 6, 1, 210, 1, 6, 1, 30, 1, 42, 1, 330, 1, 6, 1, 2730, 1, 6, 1, 30, 1, 462, 1, 510, 1, 6, 1, 51870, 1, 6, 1, 330, 1, 42, 1, 690, 1, 6, 1, 46410, 1, 66, 1, 30, 1, 798, 1, 870, 1, 6, 1, 930930, 1, 6, 1, 510, 1, 966, 1, 30, 1, 66, 1, 1919190, 1, 6, 1, 30, 1, 42, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,3
|
|
|
COMMENTS
|
As in A166062, the offset is rather arbitrary.
The sequence contains numbers like 210 which are not in A006954.
One could also consider dividing by the largest prime divisor of A027642 instead of A089026, which yields 1, 1, 2, 1, 6, 1, 6, 1, 6, 1, 6, 1, 210, 1, 2, 1, 30, 1, 42, 1, 30, ... as an alternative version.
These are the Clausen numbers based on the proper divisors of n whereas the classical Clausen numbers A160014 are based on all divisors of n. (The proper divisors are the divisors of n that are less than n.) - Peter Luschny, Aug 20 2022
|
|
|
LINKS
|
|
|
|
MAPLE
|
A027642 := proc(n) denom(bernoulli(n)) ; end:
A089026 := proc(n) if isprime(n) then n; else 1; end if; end proc:
# Second program, assuming offset 0:
clausen := proc(n) if irem(n, 2)=1 then 1 else numtheory[divisors](n) minus {n};
map(i -> i+1, %); select(isprime, %); mul(i, i=%) fi end:
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
|
|
|
EXTENSIONS
|
|
|
|
STATUS
|
approved
|
| |
|
|
