login
This site is supported by donations to The OEIS Foundation.

 

Logo

"Email this user" was broken Aug 14 to 9am Aug 16. If you sent someone a message in this period, please send it again.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A269589 Number of triples 0 <= i, j, k < n such that bitwise AND of i, j, k is 0. 0
1, 7, 25, 49, 109, 175, 265, 343, 559, 763, 1015, 1225, 1573, 1855, 2161, 2401, 3217, 3913, 4705, 5341, 6325, 7105, 7933, 8575, 9943, 11011, 12127, 12985, 14197, 15127, 16081, 16807, 19975, 22519, 25255, 27391, 30511, 32935, 35455, 37387 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Start with A = [[[1]]], iteratively replace every element Aijk with  Aijk * [[[1, 1], [1, 1]], [[1, 1], [1, 0]]]. a(n) is the sum of the resulting array inside the cubic region i, j, k < n. - Peter Karpov, Mar 01 2016

a(n) is a lower bound on A268239. - Peter Karpov, Mar 01 2016

LINKS

Table of n, a(n) for n=1..40.

Peter Karpov, InvMem, Item 21

FORMULA

a(1) = 1, a(2*n) = 7*a(n), a(2*n+1) = 4*a(n+1) + 3*a(n) - 6*A080100(2*n+1).

MATHEMATICA

a[n_] := If[Mod[n, 2] == 0, 7 a[n/2], 4 a[(n + 1)/2] + 3 a[(n - 1)/2] - 6 * 2^DigitCount[n, 2, 0]]; a[1] := 1;

Table[a[i], {i, 1, 40}]

CROSSREFS

Cf. A268524.

Sequence in context: A031294 A147129 A173825 * A278874 A137380 A094672

Adjacent sequences:  A269586 A269587 A269588 * A269590 A269591 A269592

KEYWORD

nonn

AUTHOR

Peter Karpov, Mar 01 2016

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified August 17 07:59 EDT 2017. Contains 290635 sequences.