A104621 -id:A104621 - cp's OEIS frontend

A251712 7-step Fibonacci sequence starting with (0,0,0,1,0,0,0).

0, 0, 0, 1, 0, 0, 0, 1, 2, 4, 8, 15, 30, 60, 120, 239, 476, 948, 1888, 3761, 7492, 14924, 29728, 59217, 117958, 234968, 468048, 932335, 1857178, 3699432, 7369136, 14679055, 29240152, 58245336, 116022624, 231112913, 460368648, 917037864, 1826706592, 3638734129

Offset: 0

Arie Bos, Dec 07 2014

Index entries for linear recurrences with constant coefficients, signature (1,1,1,1,1,1,1).

Other 7-step Fibonacci sequences are A066178, A104621, A122189, A251710, A251711, A251713, A251714.

NB. see A251713 for the program and apply it to 0 0 0 1 0 0 0.

LinearRecurrence[Table[1, {7}], {0, 0, 0, 1, 0, 0, 0}, 40] (* Michael De Vlieger, Dec 09 2014 *)

a(n+7) = a(n) + a(n+1) + a(n+2) + a(n+3) + a(n+4) + a(n+5) + a(n+6).

G.f.: x^3*(-1+x+x^2+x^3)/(-1+x+x^2+x^3+x^4+x^5+x^6+x^7) . - R. J. Mathar, Mar 28 2025

A251713 7-step Fibonacci sequence starting with (0,0,1,0,0,0,0).

Original entry on oeis.org

0, 0, 1, 0, 0, 0, 0, 1, 2, 4, 7, 14, 28, 56, 112, 223, 444, 884, 1761, 3508, 6988, 13920, 27728, 55233, 110022, 219160, 436559, 869610, 1732232, 3450544, 6873360, 13691487, 27272952, 54326744, 108216929, 215564248, 429396264, 855341984, 1703810608, 3393929729

Offset: 0

Arie Bos, Dec 07 2014

Index entries for linear recurrences with constant coefficients, signature (1,1,1,1,1,1,1).

Other 7-step Fibonacci sequences are A066178, A104621, A122189, A251710, A251711, A251712, A251714.

(see www.jsoftware.com) First construct the generating matrix
   [M=: (#.@}: + {:)\"1&.|: <:/~i.7
 1  1  1  1  1  1  1
 1  2  2  2  2  2  2
 2  3  4  4  4  4  4
 4  6  7  8  8  8  8
 8 12 14 15 16 16 16
16 24 28 30 31 32 32
32 48 56 60 62 63 64
Given that matrix, one can produce the first 7*150 numbers by
, M(+/ . *)^:(i.150) 0 0 1 0 0 0 0x

LinearRecurrence[Table[1, {7}], {0, 0, 1, 0, 0, 0, 0}, 40] (* Michael De Vlieger, Dec 09 2014 *)

a(n+7) = a(n) + a(n+1) + a(n+2) + a(n+3) + a(n+4) + a(n+5) + a(n+6).

G.f.: x^2*(-1+x+x^2+x^3+x^4)/(-1+x+x^2+x^3+x^4+x^5+x^6+x^7) . - R. J. Mathar, Mar 28 2025

A251714 7-step Fibonacci sequence starting with (0,1,0,0,0,0,0).

Original entry on oeis.org

0, 1, 0, 0, 0, 0, 0, 1, 2, 3, 6, 12, 24, 48, 96, 191, 380, 757, 1508, 3004, 5984, 11920, 23744, 47297, 94214, 187671, 373834, 744664, 1483344, 2954768, 5885792, 11724287, 23354360, 46521049, 92668264, 184591864, 367700384, 732446000, 1459006208, 2906288129

Offset: 0

Arie Bos, Dec 07 2014

Index entries for linear recurrences with constant coefficients, signature (1,1,1,1,1,1,1).

Other 7-step Fibonacci sequences are A066178, A104621, A122189, A251710, A251711, A251712, A251713.

NB. see A251713 for the program and apply it to 0 1 0 0 0 0 0.

LinearRecurrence[Table[1, {7}], {0, 1, 0, 0, 0, 0, 0}, 40] (* Michael De Vlieger, Dec 09 2014 *)

a(n+7) = a(n) + a(n+1) + a(n+2) + a(n+3) + a(n+4) + a(n+5) + a(n+6).

G.f.: x*(-1+x+x^2+x^3+x^4+x^5)/(-1+x+x^2+x^3+x^4+x^5+x^6+x^7) . - R. J. Mathar, Mar 28 2025

A127208 Union of all n-step Lucas sequences, that is, all sequences s(1-n) = s(2-n) = ... = s(-1) = -1, s(0) = n and for k > 0, s(k) = s(k-1) + ... + s(k-n).

Original entry on oeis.org

1, 3, 4, 7, 11, 15, 18, 21, 26, 29, 31, 39, 47, 51, 57, 63, 71, 76, 99, 113, 120, 123, 127, 131, 191, 199, 223, 239, 241, 247, 255, 322, 367, 439, 443, 475, 493, 502, 511, 521, 708, 815, 843, 863, 943, 983, 1003, 1013, 1023, 1364, 1365, 1499, 1695, 1871, 1959

Offset: 1

T. D. Noe, Jan 09 2007

nonn

Noe and Post conjectured that the only positive terms that are common to any two distinct n-step Lucas sequences are the Mersenne numbers (A001348) that begin each sequence and 7 and 11 (in 2- and 3-step) and 5071 (in 3- and 4-step). The intersection of this sequence with the union of all the n-step Fibonacci sequences (A124168) appears to consist of 4, 21, 29, the Mersenne numbers 2^n-1 for all n and the infinite set of Eulerian numbers in A127232.

T. D. Noe, Table of n, a(n) for n=1..1000
Tony D. Noe and Jonathan Vos Post, Primes in Fibonacci n-step and Lucas n-step Sequences, J. of Integer Sequences, Vol. 8 (2005), Article 05.4.4

Cf. A227885.

LucasSequence[n_,kMax_] := Module[{a,s,lst={}}, a=Join[Table[ -1,{n-1}],{n}]; While[s=Plus@@a; a=RotateLeft[a]; a[[n]]=s; s<=kMax, AppendTo[lst,s]]; lst]; nn=10; t={}; Do[t=Union[t,LucasSequence[n,2^(nn+1)]], {n,2,nn}]; t

Union(A000032, A001644, A073817, A074048, A074584, A104621, A105754, A105755,...)

A247505 Generalized Lucas numbers: square array A(n,k) read by antidiagonals, A(n,k)=(-1)^(k+1)k[x^k](-log((1+sum_{j=1..n}(-1)^(j+1)*x^j)^(-1))), (n>=0, k>=0).

Original entry on oeis.org

0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 3, 1, 0, 0, 1, 3, 4, 1, 0, 0, 1, 3, 7, 7, 1, 0, 0, 1, 3, 7, 11, 11, 1, 0, 0, 1, 3, 7, 15, 21, 18, 1, 0, 0, 1, 3, 7, 15, 26, 39, 29, 1, 0, 0, 1, 3, 7, 15, 31, 51, 71, 47, 1, 0, 0, 1, 3, 7, 15, 31, 57, 99, 131, 76, 1, 0

Offset: 0

Peter Luschny, Nov 02 2014

			n\k[0][1][2][3] [4] [5] [6]  [7]  [8]  [9]  [10]  [11]  [12]
[0] 0, 0, 0, 0,  0,  0,  0,   0,   0,   0,    0,    0,    0
[1] 0, 1, 1, 1,  1,  1,  1,   1,   1,   1,    1,    1,    1
[2] 0, 1, 3, 4,  7, 11, 18,  29,  47,  76,  123,  199,  322 [A000032]
[3] 0, 1, 3, 7, 11, 21, 39,  71, 131, 241,  443,  815, 1499 [A001644]
[4] 0, 1, 3, 7, 15, 26, 51,  99, 191, 367,  708, 1365, 2631 [A073817]
[5] 0, 1, 3, 7, 15, 31, 57, 113, 223, 439,  863, 1695, 3333 [A074048]
[6] 0, 1, 3, 7, 15, 31, 63, 120, 239, 475,  943, 1871, 3711 [A074584]
[7] 0, 1, 3, 7, 15, 31, 63, 127, 247, 493,  983, 1959, 3903 [A104621]
[8] 0, 1, 3, 7, 15, 31, 63, 127, 255, 502, 1003, 2003, 3999 [A105754]
[.] .  .  .  .   .   .   .    .    .    .     .     .     .
oo] 0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 2047, 4095 [A000225]
'
As a triangular array, starts:
0,
0, 0,
0, 1, 0,
0, 1, 1, 0,
0, 1, 3, 1, 0,
0, 1, 3, 4, 1, 0,
0, 1, 3, 7, 7, 1,  0,
0, 1, 3, 7, 11, 11, 1, 0,
0, 1, 3, 7, 15, 21, 18, 1, 0,
0, 1, 3, 7, 15, 26, 39, 29, 1, 0,

Cf. A247506, A000225, A000032, A001644, A073817, A074048, A074584, A104621, A105754.

Cf. A125127.

A := proc(n, k) f := -log((1+add((-1)^(j+1)*x^j, j=1..n))^(-1));
(-1)^(k+1)*k*coeff(series(f,x,k+2),x,k) end:
seq(print(seq(A(n,k), k=0..12)), n=0..8);

A[n_, k_] := Module[{f, x}, f = -Log[(1+Sum[(-1)^(j+1) x^j, {j, 1, n}] )^(-1)]; (-1)^(k+1) k SeriesCoefficient[f, {x, 0, k}]];
Table[A[n-k, k], {n, 0, 12}, {k, 0, n}] (* Jean-François Alcover, Jun 28 2019, from Maple *)

A125129 Partial sums of diagonals of array of k-step Lucas numbers as in A125127, read by antidiagonals.

Original entry on oeis.org

1, 1, 4, 1, 8, 11, 1, 12, 19, 26, 1, 19, 33, 45, 57, 1, 30, 58, 84, 102, 120, 1, 48, 101, 157, 197, 222, 247, 1, 77, 179, 292, 380, 436, 469, 502, 1, 124, 318, 546, 731, 855, 929, 971, 1013, 1, 200, 567, 1026, 1409, 1674, 1838, 1932, 1984, 2036

Offset: 1

Jonathan Vos Post, Nov 23 2006

Array of partial sums of diagonals of L(k,n) begins: 0.|.1...4..11...26...57..120..247..502.1013.2036.
|.1...8..19...45..102..222..469..971.1984.
|.1..12..33...84..197..436..929.1932.
|.1..19..58..157..380..855.1838.
|.1..30.101..292..731.1674.
|.1..48.179..546.1409.
|.1..77.318.1026.
|.1.124.567.
|.1.200.
|.1.

			Row 1 of the derived array is the partial sum of the diagonal above the main diagonal of array of k-step Lucas numbers as in A125127, hence the partial sums of: 1, 7, 11, 26, 57, 120, 247, 502, 103, ... are 1 = 1; 8 = 1 + 7; 19 = 1 + 7 + 11; 45 = 1 + 7 + 11 + 26; and so forth.

Cf. A000012, A000032, A000204, A001644, A001648, A048887, A048888, A074048, A074584, A092921, A104621, A105754, A105755, A125127, A000295.

Row 0 = SUM[i=1..n]L(i,i) = A127128 = partial sum of main diagonal of array of A125127. Row 1 = SUM[i=1..n]L(i,i+1) = partial sum of diagonal above main diagonal of array of A125127. Row 2 = SUM[i=1..n]L(i,i+2) = partial sum of diagonal 2 above main diagonal of array of A125127. .. Row m = SUM[i=1..n]L(i,i+m) = partial sum of diagonal 2 above main diagonal of array of A125127.

A227885 Primes in the union of all n-step Lucas sequences.

Original entry on oeis.org

2, 3, 7, 11, 29, 31, 47, 71, 113, 127, 131, 191, 199, 223, 239, 241, 367, 439, 443, 521, 863, 983, 1013, 1499, 1871, 2003, 2207, 3571, 6553, 8087, 8191, 9349, 16369, 32647, 32707, 36319, 63487, 65407, 65519, 122401, 126719, 131071, 196331, 260111, 524287

Offset: 1

Robert Price, Oct 25 2013

nonn

T. D. Noe, Table of n, a(n) for n = 1..1000 (first 383 terms from Robert Price)
Tony D. Noe and Jonathan Vos Post, Primes in Fibonacci n-step and Lucas n-step Sequences, J. of Integer Sequences, Vol. 8 (2005), Article 05.4.4

Cf. A127208, A000032, A001644, A073817, A074048, A074584, A104621, A105754, A105755.

plst={2}; plimit=10^39; For[n=2, n<=3+Log[2,plimit], n++, llst={}; For[i=1, i

2 and the primes in A127208.

cp's OEIS Frontend

A251712 7-step Fibonacci sequence starting with (0,0,0,1,0,0,0).

Views

Author

Keywords

Links

Crossrefs

Programs

J

Mathematica

Formula

A251713 7-step Fibonacci sequence starting with (0,0,1,0,0,0,0).

Views

Author

Keywords

Links

Crossrefs

Programs

J

Mathematica

Formula

A251714 7-step Fibonacci sequence starting with (0,1,0,0,0,0,0).

Views

Author

Keywords

Links

Crossrefs

Programs

J

Mathematica

Formula

A127208 Union of all n-step Lucas sequences, that is, all sequences s(1-n) = s(2-n) = ... = s(-1) = -1, s(0) = n and for k > 0, s(k) = s(k-1) + ... + s(k-n).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A247505 Generalized Lucas numbers: square array A(n,k) read by antidiagonals, A(n,k)=(-1)^(k+1)*k*[x^k](-log((1+sum_{j=1..n}(-1)^(j+1)*x^j)^(-1))), (n>=0, k>=0).

Views

Author

Keywords

Examples

Crossrefs

Programs

Maple

Mathematica

A125129 Partial sums of diagonals of array of k-step Lucas numbers as in A125127, read by antidiagonals.

Views

Author

Keywords

Comments

Examples

Crossrefs

Formula

A227885 Primes in the union of all n-step Lucas sequences.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Formula

A247505 Generalized Lucas numbers: square array A(n,k) read by antidiagonals, A(n,k)=(-1)^(k+1)k[x^k](-log((1+sum_{j=1..n}(-1)^(j+1)*x^j)^(-1))), (n>=0, k>=0).