login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A101119 Nonzero differences of A006519 (highest power of 2 dividing n) and A003484 (Radon function). 6
7, 22, 7, 52, 7, 22, 7, 112, 7, 22, 7, 52, 7, 22, 7, 239, 7, 22, 7, 52, 7, 22, 7, 112, 7, 22, 7, 52, 7, 22, 7, 494, 7, 22, 7, 52, 7, 22, 7, 112, 7, 22, 7, 52, 7, 22, 7, 239, 7, 22, 7, 52, 7, 22, 7, 112, 7, 22, 7, 52, 7, 22, 7, 1004, 7, 22, 7, 52, 7, 22, 7, 112, 7, 22, 7, 52, 7, 22, 7, 239 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
A006519 and A003484 differ only at every 16th term; this sequence forms the nonzero differences. Records form A101120. Equals the XOR BINOMIAL transform of A101122.
LINKS
FORMULA
a(n) = A006519(16*n) - A003484(16*n) for n>=1. a(2*n-1) = 7 for n>=1.
MATHEMATICA
Table[2^(IntegerExponent[16*n, 2]) - 8*Floor[IntegerExponent[16*n, 2]/4] - 2^(Mod[IntegerExponent[16*n, 2], 4]), {n, 1, 50}] (* G. C. Greubel, Nov 01 2018 *)
PROG
(PARI) {a(n)=2^valuation(16*n, 2)-(8*(valuation(16*n, 2)\4)+2^(valuation(16*n, 2)%4))}
(Magma) [2^Valuation(16*n, 2) - 8*Floor(Valuation(16*n, 2)/4) - 2^(Valuation(16*n, 2) mod 4): n in [1..50]]; // G. C. Greubel, Nov 01 2018
(Python)
def A101119(n): return (1<<(m:=(~n&n-1).bit_length()+4))-((m&-4)<<1)-(1<<(m&3)) # Chai Wah Wu, Jul 10 2022
CROSSREFS
Sequence in context: A213152 A082826 A130740 * A217014 A200886 A070412
KEYWORD
nonn
AUTHOR
Simon Plouffe and Paul D. Hanna, Dec 02 2004
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 11:46 EDT 2024. Contains 371241 sequences. (Running on oeis4.)