A147649 - cp's OEIS frontend

A147649 Binary prejudiced single Sierpinski modulo two Pascal shift: Prejudice function: p(n,m)=If[Mod[Binomial[n - 2, m - 1], 2] == 0, Round[Log[2]]/2, 1]; t(n,m)=Binomial[n, m] + If[n > 2, 2Binomial[n - 2, m - 1]p(n, m), 0]; Mod[If[n > 2, 2Binomial[n - 2, m - 1]p(n,m), 0],2]=0.

n	a(n)
0	1
1	1
2	1
3	1
4	2
5	1
6	1
7	5
8	5
9	1
10	1
11	6
12	8
13	6
14	1
15	1
16	7
17	16
18	16
19	7
20	1
21	1
22	8
23	19
24	26
25	19
26	8
27	1
28	1
29	9
30	31
31	45
32	45
33	31
34	9
35	1
36	1
37	10
38	34
39	86
40	90
41	86
42	34
43	10
44	1
45	1
46	11
47	50
48	126
49	196
50	196
51	126
52	50
53	11
54	1
55	1
56	12
57	53
58	148
59	266
60	322
61	266
62	148
63	53
64	12
65	1

[1, 1, 1, 1, 2, 1, 1, 5, 5, 1, 1, 6, 8, 6, 1, 1, 7, 16, 16, 7, 1, 1, 8, 19, 26, 19, 8, 1, 1, 9, 31, 45, 45, 31, 9, 1, 1, 10, 34, 86, 90, 86, 34, 10, 1, 1, 11, 50, 126, 196, 196, 126, 50, 11, 1, 1, 12, 53, 148, 266, 322, 266, 148, 53, 12, 1]

cp's OEIS Frontend

A147649 Binary prejudiced single Sierpinski modulo two Pascal shift: Prejudice function: p(n,m)=If[Mod[Binomial[n - 2, m - 1], 2] == 0, Round[Log[2]]/2, 1]; t(n,m)=Binomial[n, m] + If[n > 2, 2Binomial[n - 2, m - 1]p(n, m), 0]; Mod[If[n > 2, 2Binomial[n - 2, m - 1]p(n,m), 0],2]=0.

Table of values

List of values

n	a(n)
0	1
1	1
2	1
3	1
4	2
5	1
6	1
7	5
8	5
9	1
10	1
11	6
12	8
13	6
14	1
15	1
16	7
17	16
18	16
19	7
20	1
21	1
22	8
23	19
24	26
25	19
26	8
27	1
28	1
29	9
30	31
31	45
32	45
33	31
34	9
35	1
36	1
37	10
38	34
39	86
40	90
41	86
42	34
43	10
44	1
45	1
46	11
47	50
48	126
49	196
50	196
51	126
52	50
53	11
54	1
55	1
56	12
57	53
58	148
59	266
60	322
61	266
62	148
63	53
64	12
65	1

n	a(n)
0	1
1	1
2	1
3	1
4	2
5	1
6	1
7	5
8	5
9	1
10	1
11	6
12	8
13	6
14	1
15	1
16	7
17	16
18	16
19	7
20	1
21	1
22	8
23	19
24	26
25	19
26	8
27	1
28	1
29	9
30	31
31	45
32	45
33	31
34	9
35	1
36	1
37	10
38	34
39	86
40	90
41	86
42	34
43	10
44	1
45	1
46	11
47	50
48	126
49	196
50	196
51	126
52	50
53	11
54	1
55	1
56	12
57	53
58	148
59	266
60	322
61	266
62	148
63	53
64	12
65	1

cp's OEIS Frontend

A147649 Binary prejudiced single Sierpinski modulo two Pascal shift: Prejudice function: p(n,m)=If[Mod[Binomial[n - 2, m - 1], 2] == 0, Round[Log[2]]/2, 1]; t(n,m)=Binomial[n, m] + If[n > 2, 2*Binomial[n - 2, m - 1]*p(n, m), 0]; Mod[If[n > 2, 2*Binomial[n - 2, m - 1]*p(n,m), 0],2]=0.

Table of values

List of values

A147649 Binary prejudiced single Sierpinski modulo two Pascal shift: Prejudice function: p(n,m)=If[Mod[Binomial[n - 2, m - 1], 2] == 0, Round[Log[2]]/2, 1]; t(n,m)=Binomial[n, m] + If[n > 2, 2Binomial[n - 2, m - 1]p(n, m), 0]; Mod[If[n > 2, 2Binomial[n - 2, m - 1]p(n,m), 0],2]=0.

n	a(n)
0	1
1	1
2	1
3	1
4	2
5	1
6	1
7	5
8	5
9	1
10	1
11	6
12	8
13	6
14	1
15	1
16	7
17	16
18	16
19	7
20	1
21	1
22	8
23	19
24	26
25	19
26	8
27	1
28	1
29	9
30	31
31	45
32	45
33	31
34	9
35	1
36	1
37	10
38	34
39	86
40	90
41	86
42	34
43	10
44	1
45	1
46	11
47	50
48	126
49	196
50	196
51	126
52	50
53	11
54	1
55	1
56	12
57	53
58	148
59	266
60	322
61	266
62	148
63	53
64	12
65	1