A036982 - cp's OEIS frontend

A036982 a(n)=[ aa(n-1)+b ]/p^r, where a=2.001, b=3.2, p=2 and p^r is the highest power of p dividing [ aa(n-1)+b ].

n	a(n)
0	1
1	5
2	13
3	29
4	61
5	125
6	253
7	509
8	1021
9	1023
10	1025
11	1027
12	1029
13	1031
14	1033
15	1035
16	1037
17	1039
18	1041
19	1043
20	1045
21	1047
22	1049
23	1051
24	1053
25	1055
26	1057
27	1059
28	1061
29	1063
30	1065
31	1067
32	1069
33	1071
34	1073
35	1075
36	1077
37	1079
38	1081
39	1083
40	1085
41	1087
42	1089
43	1091
44	1093

[1, 5, 13, 29, 61, 125, 253, 509, 1021, 1023, 1025, 1027, 1029, 1031, 1033, 1035, 1037, 1039, 1041, 1043, 1045, 1047, 1049, 1051, 1053, 1055, 1057, 1059, 1061, 1063, 1065, 1067, 1069, 1071, 1073, 1075, 1077, 1079, 1081, 1083, 1085, 1087, 1089, 1091, 1093]

cp's OEIS Frontend

A036982 a(n)=[ aa(n-1)+b ]/p^r, where a=2.001, b=3.2, p=2 and p^r is the highest power of p dividing [ aa(n-1)+b ].

Table of values

List of values

cp's OEIS Frontend

A036982 a(n)=[ a*a(n-1)+b ]/p^r, where a=2.001, b=3.2, p=2 and p^r is the highest power of p dividing [ a*a(n-1)+b ].

Table of values

List of values

A036982 a(n)=[ aa(n-1)+b ]/p^r, where a=2.001, b=3.2, p=2 and p^r is the highest power of p dividing [ aa(n-1)+b ].