|
|
A327491
|
|
a(0) = 0. If 4 divides n then a(n) = valuation(n, 2) else a(n) = (n mod 2) + 1.
|
|
6
|
|
|
0, 2, 1, 2, 2, 2, 1, 2, 3, 2, 1, 2, 2, 2, 1, 2, 4, 2, 1, 2, 2, 2, 1, 2, 3, 2, 1, 2, 2, 2, 1, 2, 5, 2, 1, 2, 2, 2, 1, 2, 3, 2, 1, 2, 2, 2, 1, 2, 4, 2, 1, 2, 2, 2, 1, 2, 3, 2, 1, 2, 2, 2, 1, 2, 6, 2, 1, 2, 2, 2, 1, 2, 3, 2, 1, 2, 2, 2, 1, 2, 4, 2, 1, 2, 2, 2, 1, 2
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
Seen as an irregular table for n >= 1:
2,
1, 2,
2, 2, 1, 2,
3, 2, 1, 2, 2, 2, 1, 2,
4, 2, 1, 2, 2, 2, 1, 2, 3, 2, 1, 2, 2, 2, 1, 2,
5, 2, 1, 2, 2, 2, 1, 2, 3, 2, 1, 2, 2, 2, 1, 2, 4, 2, 1, 2, ....
|
|
MAPLE
|
elif 0 = irem(n, 4) then padic[ordp](n, 2)
elif 0 = irem(n, 2) then 1 else 2 fi:
|
|
PROG
|
(SageMath)
if n == 0: return 0
if 4.divides(n): return valuation(n, 2)
return n % 2 + 1
print([A327491(n) for n in (0..87)])
(PARI) a(n)={if(n==0, 0, if(n%4, n%2 + 1, valuation(n, 2)))} \\ Andrew Howroyd, Sep 28 2019
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|