[go: up one dir, main page]

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!)
Revision History for A268524 (Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A268524 a(n) = r*a(ceiling(n/2))+s*a(floor(n/2)) with a(1)=1 and (r,s)=(3,1).
(history; published version)
#22 by Michael De Vlieger at Sat Jun 25 17:07:08 EDT 2022
STATUS

proposed

approved

#21 by Jon E. Schoenfield at Sat Jun 25 16:00:01 EDT 2022
STATUS

editing

proposed

#20 by Jon E. Schoenfield at Sat Jun 25 15:59:58 EDT 2022
COMMENTS

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

STATUS

approved

editing

#19 by N. J. A. Sloane at Thu Mar 24 12:15:35 EDT 2016
STATUS

editing

approved

#18 by N. J. A. Sloane at Thu Mar 24 12:14:27 EDT 2016
COMMENTS

Number of tripletstriples 0 <= i, j, k < n such that bitwise AND of all pairs (i, j), (j, k), (k, i) is 0. - Peter Karpov, Mar 01 2016

STATUS

proposed

editing

Discussion
Thu Mar 24 12:15
N. J. A. Sloane: "Triples" is correct. NOT "triplets" (unless you are a midwife)
#17 by Michel Marcus at Thu Mar 24 12:00:08 EDT 2016
STATUS

editing

proposed

#16 by Michel Marcus at Thu Mar 24 11:59:58 EDT 2016
COMMENTS

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

PROG

(PARI) a(n) = if (n==1, 1, 3*a(ceil(n/2)) + a(floor(n/2))); \\ Michel Marcus, Mar 24 2016

STATUS

proposed

editing

#15 by Peter Karpov at Tue Mar 01 13:42:36 EST 2016
STATUS

editing

proposed

#14 by Peter Karpov at Tue Mar 01 12:25:24 EST 2016
COMMENTS

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

STATUS

proposed

editing

#13 by Peter Karpov at Tue Mar 01 12:17:53 EST 2016
STATUS

editing

proposed

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 August 29 13:55 EDT 2024. Contains 375517 sequences. (Running on oeis4.)