Sequences

392,541 sequences

a(n) = [ sum of 1/{k*sqrt(6)} ] for k = 1,2,...,n, where {x} := x - [ x ].A024561
a(n) = [ sum of 1/{k*sqrt(6)} ] for k = 1,2,...,n, where {x} := x - [ x ].
a(n) = integer nearest a(n-1)/(sqrt(6) - 2), where a(0) = 1.A024562
a(n) = integer nearest a(n-1)/(sqrt(6) - 2), where a(0) = 1.
a(n) = [ n/{n*sqrt(7)} ], where {x} := x - [ x ].A024563
a(n) = [ n/{n*sqrt(7)} ], where {x} := x - [ x ].
a(n) = [ 1/{n*sqrt(7)} ], where {x} := x - [ x ].A024564
a(n) = [ 1/{n*sqrt(7)} ], where {x} := x - [ x ].
a(n) = Sum_{k=1..n} [ 1/{k*sqrt(7)} ] where {x} := x - [ x ].A024565
a(n) = Sum_{k=1..n} [ 1/{k*sqrt(7)} ] where {x} := x - [ x ].
a(n) = [ sum of 1/{k*sqrt(7)} ] for k = 1,2,...,n, where {x} := x - [ x ].A024566
a(n) = [ sum of 1/{k*sqrt(7)} ] for k = 1,2,...,n, where {x} := x - [ x ].
a(n) = integer nearest a(n-1)/(sqrt(7) - 2), where a(1) = 1.A024567
a(n) = integer nearest a(n-1)/(sqrt(7) - 2), where a(1) = 1.
a(n) = [ n/{n*r} ], where r = (1 + sqrt(5))/2 and {x} := x - [ x ].A024568
a(n) = [ n/{n*r} ], where r = (1 + sqrt(5))/2 and {x} := x - [ x ].
[ 1/{n*r} ], where r = (1 + sqrt(5))/2 and {x} := x - [ x ].A024569
[ 1/{n*r} ], where r = (1 + sqrt(5))/2 and {x} := x - [ x ].
a(n) = Sum_{k=1..n} [ 1/{k*r} ] where r = (1 + sqrt(5))/2 and {x} := x - [ x ].A024570
a(n) = Sum_{k=1..n} [ 1/{k*r} ] where r = (1 + sqrt(5))/2 and {x} := x - [ x ].
a(n) = [ sum of 1/{k*r} ] for k = 1,2,...,n, where r = (1 + sqrt(5))/2 and {x} := x - [ x ].A024571
a(n) = [ sum of 1/{k*r} ] for k = 1,2,...,n, where r = (1 + sqrt(5))/2 and {x} := x - [ x ].
a(n) = [ n/{n*e} ], {x} := x - [ x ].A024572
a(n) = [ n/{n*e} ], {x} := x - [ x ].
a(n) = floor(1/frac(n*e)).A024573
a(n) = floor(1/frac(n*e)).
a(n) = Sum_{k=1..n} [ 1/{k*e} ] where {x} := x - [ x ].A024574
a(n) = Sum_{k=1..n} [ 1/{k*e} ] where {x} := x - [ x ].
a(n) = [ sum of 1/{k*e} ] for k = 1,2,...,n, where {x} := x - [ x ].A024575
a(n) = [ sum of 1/{k*e} ] for k = 1,2,...,n, where {x} := x - [ x ].
a(n) = [ e*a(n-1) ], where a(0) = 1.A024576
a(n) = [ e*a(n-1) ], where a(0) = 1.
a(n) = [ n/{n/e} ], {x} := x - [ x ].A024577
a(n) = [ n/{n/e} ], {x} := x - [ x ].
a(n) = [ 1/{n/e} ], {x} := x - [ x ].A024578
a(n) = [ 1/{n/e} ], {x} := x - [ x ].
a(n) = Sum_{k=1..n} [ 1/{k/e} ], where {x} := x - [ x ].A024579
a(n) = Sum_{k=1..n} [ 1/{k/e} ], where {x} := x - [ x ].
a(n) = [ sum of 1/{k/e} ] for k = 1,2,...,n, where {x} := x - [ x ].A024580
a(n) = [ sum of 1/{k/e} ] for k = 1,2,...,n, where {x} := x - [ x ].
a(n) = integer nearest e*a(n-1), where a(0) = 1.A024581
a(n) = integer nearest e*a(n-1), where a(0) = 1.
a(n) = floor( a(n-1)/(Pi - 3) ) with n>0, a(0)=1.A024582
a(n) = floor( a(n-1)/(Pi - 3) ) with n>0, a(0)=1.
a(n) = floor(n/{n*Pi}), where { } = fractional part.A024583
a(n) = floor(n/{n*Pi}), where { } = fractional part.
a(n) = floor(1/frac(n*Pi)).A024584
a(n) = floor(1/frac(n*Pi)).
a(n) = Sum_{k=1..n} [ 1/{k*Pi} ], where {x} := x - [ x ].A024585
a(n) = Sum_{k=1..n} [ 1/{k*Pi} ], where {x} := x - [ x ].
a(n) = floor(Sum_{k=1..n} of 1/{k*Pi}) where { } denotes fractional part.A024586
a(n) = floor(Sum_{k=1..n} of 1/{k*Pi}) where { } denotes fractional part.
Integer nearest a(n-1)/(Pi - 3), where a(0) = 1.A024587
Integer nearest a(n-1)/(Pi - 3), where a(0) = 1.
a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n+1-k), where k = [ (n+1)/2 ], s = (composite numbers).A024588
a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n+1-k), where k = [ (n+1)/2 ], s = (composite numbers).
s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (composite numbers), t = (F(2), F(3), ...).A024589
s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (composite numbers), t = (F(2), F(3), ...).
a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (composite numbers), t = (odd natural numbers).A024590
a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (composite numbers), t = (odd natural numbers).
a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n+1-k), where k = [ (n+1)/2 ], s = (F(2), F(3), ...).A024591
a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n+1-k), where k = [ (n+1)/2 ], s = (F(2), F(3), ...).
a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (F(2), F(3), ...), t = (odd natural numbers).A024592
a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (F(2), F(3), ...), t = (odd natural numbers).
a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (F(2), F(3), ...), t = A000201 (lower Wythoff sequence).A024593
a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (F(2), F(3), ...), t = A000201 (lower Wythoff sequence).
s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (F(2), F(3), ...), t = A001950 (upper Wythoff sequence).A024594
s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (F(2), F(3), ...), t = A001950 (upper Wythoff sequence).
a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = (F(2), F(3), ...), t = A023533.A024595
a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = (F(2), F(3), ...), t = A023533.
a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (F(2), F(3), ...), t = A014306.A024596
a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (F(2), F(3), ...), t = A014306.
a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (F(2), F(3), ...), t = (primes).A024597
a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (F(2), F(3), ...), t = (primes).
a(n) = s(1)*s(n) + s(2)*s(n-1) + ... + s(k)*s(n+1-k), where k = floor((n+1)/2), s = (odd natural numbers).A024598
a(n) = s(1)*s(n) + s(2)*s(n-1) + ... + s(k)*s(n+1-k), where k = floor((n+1)/2), s = (odd natural numbers).
a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (odd natural numbers), t = A000201 (lower Wythoff sequence).A024599
a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (odd natural numbers), t = A000201 (lower Wythoff sequence).
s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (odd natural numbers), t = A001950 (upper Wythoff sequence).A024600
s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (odd natural numbers), t = A001950 (upper Wythoff sequence).
a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = (odd natural numbers), t = A023533.A024601
a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = (odd natural numbers), t = A023533.
s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (odd natural numbers), t = A014306.A024602
s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (odd natural numbers), t = A014306.
a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (odd natural numbers), t = (primes).A024603
a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (odd natural numbers), t = (primes).
a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (composite numbers), t = (primes).A024604
a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (composite numbers), t = (primes).
Number in position n when the numbers i^2 - i*j + j^2 (1 <= i <= j) are arranged in nondecreasing order.A024605
Number in position n when the numbers i^2 - i*j + j^2 (1 <= i <= j) are arranged in nondecreasing order.
Numbers of form x^2 + xy + y^2 with distinct x and y > 0.A024606
Numbers of form x^2 + xy + y^2 with distinct x and y > 0.
Number of connected triangle-free graphs on n unlabeled nodes.A024607
Number of connected triangle-free graphs on n unlabeled nodes.
Positions of even numbers in A003136.A024608
Positions of even numbers in A003136.
Positions of odd numbers in A003136.A024609
Positions of odd numbers in A003136.
Position of n^2 in A003136.A024610
Position of n^2 in A003136.