显示找到的10个结果中的1-10个。
第页1
1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 0, 0, 0, 0, 7, 0, 0, 0, 0, 0, 0, 0, 0, 11, 0, 0, 0, 0, 0, 0, 0, 0, 15, 0, 0, 0, 0, 0, 0, 0, 0, 22, 0, 0, 0, 0, 0, 0, 0, 0, 30, 0, 0, 0, 0, 0, 0, 0, 0, 42, 0, 0, 0, 0, 0, 0, 0, 0, 56, 0, 0, 0
数学
f[n_]:=分区P[n/9]如果[Mod[n,9]==0,1,0];阵列[f,105](*罗伯特·威尔逊v2010年4月25日*)
n个分区的数量,这样一个分区的所有部分都具有相同的数字根。
+10 13
1, 2, 2, 3, 2, 4, 2, 4, 3, 4, 3, 7, 4, 5, 7, 6, 5, 8, 5, 8, 11, 8, 7, 16, 9, 10, 13, 12, 10, 22, 11, 15, 23, 16, 16, 26, 16, 18, 32, 22, 21, 41, 24, 27, 40, 28, 26, 55, 30, 36, 59, 40, 38, 65, 41, 45, 77, 48, 51, 95, 57, 60, 97, 66, 63, 119, 68, 80, 131, 89, 85, 150, 91, 96, 166, 104
例子
a(10)={10,5+5,2+2+2+2,10x1}=4;
a(11)={11,10+1,11x1}=3;
a(12)={12,10+1+1,6+6,4+4+4,3+3+3,2+2+2+2+2,12x1}=7。
黄体脂酮素
(哈斯克尔)
a114102 n=长度$过滤器(==1)$
地图(length.nub.(地图a010888)$ps 1 n
其中ps x 0=[[]]
ps x y=[t:ts|t<-[x.y],ts<-ps t(y-t)]
1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 4, 5, 6, 7, 7, 7, 7, 7, 7, 7, 8, 10, 11, 12, 12, 12, 12, 12, 12, 13, 15, 17, 18, 19, 19, 19, 19, 19, 20, 23, 26, 28, 29, 30, 30, 30, 30, 31, 34, 38, 41, 43, 44, 45, 45, 45, 46, 50, 55, 60, 63, 65, 66, 67, 67, 68
例子
a(18)={10+8x1,18x1}=2;
a(19)={19,10+9x1,19x1}=3;
a(20)={19+1,10+10,10+10x1,19x1}=4。
黄体脂酮素
(哈斯克尔)
a116371 n=p a017173_list n,其中
p _ 0=1
p[]_=0
p ks'@(k:ks)m=如果m<k,则0,否则p ks'(m-k)+p ks m
0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 2, 0, 0, 2, 0, 0, 2, 0, 0, 3, 0, 0, 4, 0, 0, 4, 0, 0, 5, 0, 0, 6, 0, 0, 7, 0, 0, 8, 0, 0, 10, 0, 0, 11, 0, 0, 13, 0, 0, 15, 0, 0, 17, 0, 0, 19, 0, 0, 23, 0, 0, 26, 0, 0, 29, 0, 0, 33, 0, 0, 38, 0, 0, 42, 0, 0, 48, 0, 0, 54, 0, 0, 61, 0, 0, 68, 0, 0, 77, 0, 0, 85, 0, 0, 96
例子
a(21)={21,12+3+3+3,3+3+3+3+3}=3。
0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 2, 0, 0, 1, 0, 0, 3, 0, 0, 2, 0, 0, 3, 0, 0, 3, 0, 0, 4, 0, 0, 4, 0, 0, 6, 0, 0, 5, 0, 0, 7, 0, 0, 7, 0, 0, 9, 0, 0, 9, 0, 0, 12, 0, 0, 11, 0, 0, 15, 0, 0, 15, 0, 0, 18, 0, 0, 19, 0, 0, 23, 0, 0, 23, 0, 0, 29, 0, 0, 29, 0, 0, 35, 0, 0, 37
配方奶粉
G.f.:产品{j>=0}1/(1-x^(6+9*j))-罗伯特·伊斯雷尔2015年4月13日
例子
a(30)={24+6,15+15,6+6+6+6+6}=3。
MAPLE公司
N: =1000:#将a(1)转换为a(N)
g: =mul(1/(1-x^(6+9*j)),j=0..层((N-6)/9)):
S: =系列(g,x,N+1):
seq(系数(S,x,j),j=1..N)#罗伯特·伊斯雷尔2015年4月13日
0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 2, 0, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 2, 3, 2, 1, 2, 3, 4, 1, 2, 3, 5, 2, 2, 3, 6, 4, 2, 3, 6, 6, 3, 3, 6, 7, 6, 3, 6, 8, 9, 4, 6, 8, 11, 7, 6, 8, 12, 11, 7, 8, 13, 14, 11, 8, 13, 16, 16, 9, 13, 17, 21, 13, 13, 18, 24, 20, 14, 18, 26
例子
a(39)={31+4+4,22+13+4,13+13+13}=3。
0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 2, 1, 1, 0, 1, 2, 1, 1, 0, 2, 2, 1, 1, 1, 3, 2, 1, 1, 3, 3, 2, 1, 2, 4, 3, 2, 1, 4, 5, 3, 2, 2, 6, 5, 3, 2, 5, 7, 5, 3, 3, 8, 8, 5, 3, 6, 10, 8, 5, 4, 10, 11, 8, 5, 8, 13, 12, 8, 6, 13, 15, 12, 8, 10, 18, 16, 12, 9, 17, 21, 17
例子
a(42)={32+5+5,23+14+5,14+14+14}=3。
0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 2, 0, 1, 1, 0, 1, 0, 2, 0, 2, 1, 1, 1, 0, 2, 0, 3, 1, 3, 1, 1, 2, 0, 3, 1, 4, 1, 3, 2, 1, 3, 1, 5, 1, 5, 2, 4, 3, 2, 5, 1, 6, 2, 7, 3, 5, 5, 2, 7, 2, 9, 3, 9, 5, 6, 7, 3, 10, 3, 12, 5, 11, 7, 7, 11, 4, 14, 5, 16, 7, 14
例子
a(48)={34+7+7,25+16+7,16+16+16}=3。
0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 2, 1, 0, 0, 0, 0, 1, 1, 2, 2, 1, 0, 0, 0, 1, 1, 2, 3, 3, 1, 0, 0, 1, 1, 2, 3, 4, 3, 1, 0, 1, 1, 2, 3, 5, 5, 4, 1, 1, 1, 2, 3, 5, 6, 7, 4, 2, 1, 2, 3, 5, 7, 9, 8, 6, 2, 2, 3, 5, 7, 10, 11, 11, 6, 3, 3, 5, 7, 11, 13
例子
a(51)={35+8+8,26+17+8,17+17+17}=3。
1, 1, 2, 2, 3, 4, 5, 6, 8, 10, 11, 15, 16, 20, 25, 28, 32, 39, 46, 50, 62, 66, 78, 93, 101, 112, 132, 150, 161, 192, 202, 232, 268, 287, 312, 361, 400, 425, 497, 516, 582, 658, 698, 748, 858, 932, 982, 1135, 1164, 1296, 1443, 1519, 1610, 1845, 1968, 2059, 2360, 2395
例子
包含具有通用数字根的部件:
12+3+1、11+3+2、10+5+1和10+3+2+1,
因此a(16)=32-4=28。
搜索在0.017秒内完成
查找|欢迎光临|维基|注册|音乐|地块2|演示|索引|浏览|网络摄像头
贡献新序列。或评论|格式|样式表|变换|超级搜索|最近
OEIS社区|维护人OEIS基金会。
许可协议、使用条款、隐私政策。.
上次修改时间:2024年9月21日02:58 EDT。包含376079个序列。(在oeis4上运行。)
|