[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A175880
a(1)=1, a(2)=2. If n >= 3: if n/2 is in the sequence, a(n)=0, otherwise a(n)=n.
2
1, 2, 3, 0, 5, 0, 7, 8, 9, 0, 11, 12, 13, 0, 15, 0, 17, 0, 19, 20, 21, 0, 23, 0, 25, 0, 27, 28, 29, 0, 31, 32, 33, 0, 35, 36, 37, 0, 39, 0, 41, 0, 43, 44, 45, 0, 47, 48, 49, 0, 51, 52, 53, 0, 55, 0, 57, 0, 59, 60, 61, 0, 63, 0, 65, 0, 67, 68, 69, 0, 71, 0, 73, 0, 75, 76, 77, 0, 79, 80
OFFSET
1,2
COMMENTS
If n > 0 and n is in the sequence, then a(2*n) = 0. Example: 5 is in the sequence, so a(2*5) = a(10) = 0.
Is this a(n) = n*A039982(n-1), n > 1? [R. J. Mathar, Dec 07 2010]
LINKS
FORMULA
a(n) = n - (1 + (-1)^n) * a((2*n + 1 - (-1)^n)/4), n >= 3.
a(n) = n - A010673(n+1)*a(A110654(n)).
MAPLE
A110654 := proc(n) 2*n+1-(-1)^n ; %/4 ; end proc:
A175880 := proc(n) if n <=2 then n; else if type(n, 'even') then n-2*procname(A110654(n)) ; else n; end if; end if; end proc:
seq(A175880(n), n=1..40) ; # R. J. Mathar, Dec 07 2010
PROG
(Haskell)
import Data.List (delete)
a175880 n = a175880_list !! (n-1)
a175880_list = 1 : f [2..] [2..] where
f (x:xs) (y:ys) | x == y = x : (f xs $ delete (2*x) ys)
| otherwise = 0 : (f xs (y:ys))
for_bFile = take 10000 a175880_list
-- Reinhard Zumkeller, Feb 09 2011
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Adriano Caroli, Dec 05 2010
STATUS
approved