|
|
A215456
|
|
a(n)=(4n-1)!! modulo 2n, n=1,2,...
|
|
2
|
|
|
1, 1, 3, 1, 5, 9, 7, 1, 9, 5, 11, 9, 13, 21, 15, 1, 17, 9, 19, 25, 21, 33, 23, 33, 25, 13, 27, 49, 29, 45, 31, 1, 33, 17, 35, 9, 37, 57, 39, 65, 41, 21, 43, 33, 45, 69, 47, 33, 49, 25, 51, 65, 53, 81, 55, 49, 57, 29, 59, 105, 61, 93, 63, 1, 65, 33, 67, 17, 69
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
a(n)=1 for n = 2^k. Do all odd integers appear in the sequence?
Note some linear patterns in the graph.
Note that A001147(m) modulo m is 0 for odd m's, hence we here consider only even m's.
|
|
LINKS
|
|
|
FORMULA
|
a(n)=A001147(2n) modulo 2n, n=1,2,...
|
|
MATHEMATICA
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|