|
|
A260297
|
|
a(n) = prime(n) - (hyperfactorial(prime(n)-1) mod prime(n)).
|
|
3
|
|
|
1, 2, 2, 6, 1, 5, 4, 1, 1, 12, 1, 31, 32, 1, 46, 23, 58, 11, 1, 1, 46, 78, 82, 55, 75, 91, 102, 106, 33, 98, 126, 1, 100, 138, 44, 1, 129, 1, 1, 80, 1, 162, 190, 112, 183, 198, 210, 1, 1, 122, 89, 1, 177, 250, 241, 262, 187, 1, 217, 228, 282, 138, 306, 1, 25
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
a(1) = prime(1) - (hyperfactorial(prime(1)-1)) mod prime(1) = 2 - hyperfactorial(2-1) mod (2) = 2 - 1 mod 2 = 2 - 1 = 1.
|
|
MATHEMATICA
|
Table[Prime[n] - Mod[Hyperfactorial[Prime[n] - 1], Prime[n]], {n, 1, 70}]
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|