A383621 -id:A383621 - cp's OEIS frontend

A383622 First differences of A383621.

1, 4, 5, 7, 11, 13, 14, 17, 19, 20, 23, 25, 28, 29, 31, 35, 37, 41, 43, 44, 46, 47, 49, 52, 53, 55, 59, 61, 65, 67, 68, 70, 71, 73, 76, 77, 79, 83, 85, 89, 91, 92, 95, 97, 98, 100, 101, 103, 107, 109, 113, 115, 116, 119, 121, 124, 125, 127, 131, 133, 137, 139, 140, 143

Offset: 1

Graph
List
Refs
Listen
History
Text
Internal format

Yifan Xie, May 10 2025

nonn
easy

The multiplication table T(i,j) = A027649(i) * A007310(j) for i >= 0 and j >= 1, sorted in ascending order. There are repeating terms: 322 appears twice.

Yifan Xie, Table of n, a(n) for n = 1..10000
Yifan Xie, On a solvable minimal sum antichain problem

Cf. A001047, A007310, A027649, A383621.

A027649(n) = 2*3^n-2^n;
upto(nn) = {v=[]; for(n=0, logint(nn,3), d = A027649(n); m = floor(nn/d); for(i=0, floor(m/6), if(6*i+1 <= m, v=concat(v, d*(6*i+1))); if(6*i+5 <= m, v=concat(v, d*(6*i+5))))); v=vecsort(v); v};

a(n) ~ c*n, where c = 3*(Sum_{k=0..oo} 1/A027649(k))^(-1) = 2.216821...

cp's OEIS Frontend

A383622 First differences of A383621.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

Formula