Sequences
392,541 sequences
- a(n) = a(n-1) + a(n-2) + 1, with a(0)=3, a(1)=12.A022411
a(n) = a(n-1) + a(n-2) + 1, with a(0)=3, a(1)=12.
- Expansion of 1/((1-x)(1-5x)(1-6x)(1-11x)).A022412
Expansion of 1/((1-x)(1-5x)(1-6x)(1-11x)).
- Kim-sums: "Kimberling sums" K_n + K_2.A022413
Kim-sums: "Kimberling sums" K_n + K_2.
- Kim-sums: "Kimberling sums" K_n + K_3.A022414
Kim-sums: "Kimberling sums" K_n + K_3.
- Kim-sums: "Kimberling sums" K_n + K_4.A022415
Kim-sums: "Kimberling sums" K_n + K_4.
- Kim-sums: "Kimberling sums" K_n + K_5.A022416
Kim-sums: "Kimberling sums" K_n + K_5.
- Kim-sums: "Kimberling sums" K_n + K_6.A022417
Kim-sums: "Kimberling sums" K_n + K_6.
- Kim-sums: "Kimberling sums" K_n + K_7.A022418
Kim-sums: "Kimberling sums" K_n + K_7.
- Kim-sums: "Kimberling sums" K_n + K_8.A022419
Kim-sums: "Kimberling sums" K_n + K_8.
- Kim-sums: "Kimberling sums" K_n + K_9.A022420
Kim-sums: "Kimberling sums" K_n + K_9.
- Kim-sums: "Kimberling sums" K_n + K_10.A022421
Kim-sums: "Kimberling sums" K_n + K_10.
- Kim-sums: "Kimberling sums" K_n + K_11.A022422
Kim-sums: "Kimberling sums" K_n + K_11.
- Kim-sums: "Kimberling sums" K_n + K_12.A022423
Kim-sums: "Kimberling sums" K_n + K_12.
- Solution a( ) of the complementary equation a(n) = b(n-1) + b(n-2), where a(0) = 1, a(1) = 2; see Comments.A022424
Solution a( ) of the complementary equation a(n) = b(n-1) + b(n-2), where a(0) = 1, a(1) = 2; see Comments.
- Solution a( ) of the complementary equation a(n) = b(n-1) + b(n-2), where a(0) = 1, a(1) = 4; see Comments.A022425
Solution a( ) of the complementary equation a(n) = b(n-1) + b(n-2), where a(0) = 1, a(1) = 4; see Comments.
- Solution a( ) of the complementary equation a(n) = b(n-1) + b(n-2), where a(0) = 2, a(1) = 3; see Comments.A022426
Solution a( ) of the complementary equation a(n) = b(n-1) + b(n-2), where a(0) = 2, a(1) = 3; see Comments.
- a(n) = c(n-1) + c(n-3) where c is the sequence of numbers not in a.A022427
a(n) = c(n-1) + c(n-3) where c is the sequence of numbers not in a.
- a(n) = c(n-1) + c(n-3) where c is the sequence of numbers not in a.A022428
a(n) = c(n-1) + c(n-3) where c is the sequence of numbers not in a.
- a(n) = c(n-1) + c(n-3) where c is the sequence of numbers not in a.A022429
a(n) = c(n-1) + c(n-3) where c is the sequence of numbers not in a.
- a(n) = c(n-1) + c(n-3) where c is the sequence of numbers not in a.A022430
a(n) = c(n-1) + c(n-3) where c is the sequence of numbers not in a.
- a(n) = c(n-1) + c(n-3) where c is the sequence of numbers not in a.A022431
a(n) = c(n-1) + c(n-3) where c is the sequence of numbers not in a.
- a(n) = c(n-1) + c(n-3) where c is the sequence of numbers not in a.A022432
a(n) = c(n-1) + c(n-3) where c is the sequence of numbers not in a.
- a(n) = c(n-1) + c(n-3) where c is the sequence of numbers not in a.A022433
a(n) = c(n-1) + c(n-3) where c is the sequence of numbers not in a.
- a(n) = c(n-1) + c(n-3) where c is the sequence of numbers not in a.A022434
a(n) = c(n-1) + c(n-3) where c is the sequence of numbers not in a.
- a(n) = c(n-1) + c(n-3) where c is the sequence of numbers not in a.A022435
a(n) = c(n-1) + c(n-3) where c is the sequence of numbers not in a.
- a(n) = c(n-1) + c(n-3) where c is the sequence of numbers not in a.A022436
a(n) = c(n-1) + c(n-3) where c is the sequence of numbers not in a.
- a(n) = c(n-1) + c(n-3) where c is the sequence of numbers not in a.A022437
a(n) = c(n-1) + c(n-3) where c is the sequence of numbers not in a.
- a(n) = c(n-1) + c(n-3) where c is the sequence of numbers not in a.A022438
a(n) = c(n-1) + c(n-3) where c is the sequence of numbers not in a.
- a(n) = c(n-1) + c(n-3) where c is the sequence of numbers not in a.A022439
a(n) = c(n-1) + c(n-3) where c is the sequence of numbers not in a.
- a(n) = c(n-1) + c(n-3) where c is the sequence of positive numbers not in a.A022440
a(n) = c(n-1) + c(n-3) where c is the sequence of positive numbers not in a.
- a(n) = c(n) + c(n-1) where c (A055562) is the sequence of numbers not in a.A022441
a(n) = c(n) + c(n-1) where c (A055562) is the sequence of numbers not in a.
- a(n) = c(n) + c(n-1) where c is the sequence of numbers not in a.A022442
a(n) = c(n) + c(n-1) where c is the sequence of numbers not in a.
- Sequence and first differences include all positive integers except 2.A022443
Sequence and first differences include all positive integers except 2.
- Number of self-avoiding closed walks (from (0,0) to (0,0)) of length 2n in strip {-1, 0, 1} X Z.A022444
Number of self-avoiding closed walks (from (0,0) to (0,0)) of length 2n in strip {-1, 0, 1} X Z.
- Number of self-avoiding closed walks (from 0 to 0) of length 2n in the strip {0, 1, 2} X Z of the square lattice Z X Z.A022445
Number of self-avoiding closed walks (from 0 to 0) of length 2n in the strip {0, 1, 2} X Z of the square lattice Z X Z.
- Fractal sequence of the dispersion of the composite numbers.A022446
Fractal sequence of the dispersion of the composite numbers.
- Fractal sequence of the dispersion of the primes.A022447
Fractal sequence of the dispersion of the primes.
- Expansion of 1/((1-x)*(1-5*x)*(1-6*x)*(1-12*x)).A022448
Expansion of 1/((1-x)*(1-5*x)*(1-6*x)*(1-12*x)).
- c(p(n)) where p(k) is k-th prime including p(1)=1 and c(k) is k-th composite number.A022449
c(p(n)) where p(k) is k-th prime including p(1)=1 and c(k) is k-th composite number.
- a(1) = 2; a(n+1) = a(n)-th composite.A022450
a(1) = 2; a(n+1) = a(n)-th composite.
- a(1) = 3; a(n+1) = a(n)-th composite.A022451
a(1) = 3; a(n+1) = a(n)-th composite.
- Expansion of 1/((1-x)*(1-5*x)*(1-7*x)*(1-8*x)).A022452
Expansion of 1/((1-x)*(1-5*x)*(1-7*x)*(1-8*x)).
- Expansion of 1/((1-x)*(1-5*x)*(1-7*x)*(1-9*x)).A022453
Expansion of 1/((1-x)*(1-5*x)*(1-7*x)*(1-9*x)).
- Expansion of 1/((1-x)*(1-5*x)*(1-7*x)*(1-10*x)).A022454
Expansion of 1/((1-x)*(1-5*x)*(1-7*x)*(1-10*x)).
- Expansion of 1/((1-x)*(1-5*x)*(1-7*x)*(1-11*x)).A022455
Expansion of 1/((1-x)*(1-5*x)*(1-7*x)*(1-11*x)).
- Expansion of 1/((1-x)*(1-5*x)*(1-7*x)*(1-12*x)).A022456
Expansion of 1/((1-x)*(1-5*x)*(1-7*x)*(1-12*x)).
- a(n) = prime(2n) mod prime(n).A022457
a(n) = prime(2n) mod prime(n).
- a(n) = prime(2n-1) mod prime(n).A022458
a(n) = prime(2n-1) mod prime(n).
- a(n) = prime(2n+1) mod prime(n).A022459
a(n) = prime(2n+1) mod prime(n).
- a(n) = prime(3*n) mod prime(n).A022460
a(n) = prime(3*n) mod prime(n).