|
|
|
|
|
|
|
|
|
#15 by Bruno Berselli at Tue Nov 21 03:12:19 EST 2017
|
|
|
|
|
|
|
|
#14 by Paolo P. Lava at Tue Nov 21 03:01:17 EST 2017
|
|
|
|
|
|
|
|
#13 by Rémy Sigrist at Tue Nov 21 01:12:36 EST 2017
|
|
|
|
|
|
|
|
#12 by Rémy Sigrist at Tue Nov 21 00:27:26 EST 2017
|
|
| LINKS
|
Rémy Sigrist, <a href="/A295277/b295277.txt">Table of n, a(n) for n = 1..25000</a>
|
|
| STATUS
|
approved
editing
|
|
|
|
|
Discussion
|
| Tue Nov 21
| 01:12
| Rémy Sigrist: added b-file
|
|
|
|
|
|
|
#11 by Susanna Cuyler at Mon Nov 20 22:08:22 EST 2017
|
|
|
|
|
|
|
|
#10 by Rémy Sigrist at Mon Nov 20 13:59:36 EST 2017
|
|
|
|
|
|
|
|
#9 by Rémy Sigrist at Mon Nov 20 13:40:08 EST 2017
|
|
|
|
|
|
|
|
#8 by Rémy Sigrist at Sun Nov 19 15:32:07 EST 2017
|
|
| PROG
|
(PARI) mx=-1; for (n=1, 86, v=sum(i=0, mx, bitand(i, n)==0); print1(v ", "); mx=max(mx, v))
|
|
|
|
|
|
|
#7 by Rémy Sigrist at Sun Nov 19 15:04:57 EST 2017
|
|
| LINKS
|
Rémy Sigrist, <a href="/A295277/a295277_1.png">Colored scatterplot of the first 2^20 terms</a> (where the color is function of min(A000120(a(n)), A000120((Max_{k=1..n-1} a(k))+1-a(n))))
|
|
| EXAMPLE
|
n a(n) Distinct earlier terms with no common one bit with n
-- ---- ----------------------------------------------------
-- ---- ----------------------------------------------------
1 1 0 {} {}
2 2 1 { {0}
3 3 1 { {0}
4 4 2 { {0, 1}
5 5 2 { {0, 2}
6 6 2 { {0, 1}
7 7 1 { {0}
8 8 3 { {0, 1, 2}
9 9 2 { {0, 2}
10 10 2 { {0, 1}
11 11 1 { {0}
12 12 4 { {0, 1, 2, 3}
13 13 2 { {0, 2}
14 14 2 { {0, 1}
15 15 1 { {0}
16 16 5 { {0, 1, 2, 3, 4}
17 17 3 { {0, 2, 4}
18 18 4 { {0, 1, 4, 5}
19 19 2 { {0, 4}
20 20 4 { {0, 1, 2, 3}
|
|
|
|
|
|
|
#6 by Rémy Sigrist at Sun Nov 19 12:33:44 EST 2017
|
|
| COMMENTS
|
This sequence is a variant of A295276: here we count earlier terms without multiplicity, there with multiplicity.
The scatterplot of the first terms has fractal features (see scatterplot in Links section); see also A295283 for a variant of this sequence.
|
|
|
|
|
|
