Sequences
392,541 sequences
- Let k be the least integer such that n^2 + Sum_{m=1..k} m^2 is a perfect square, then a(n) is the resulting square.A065611
Let k be the least integer such that n^2 + Sum_{m=1..k} m^2 is a perfect square, then a(n) is the resulting square.
- Square roots of terms in A065611.A065612
Square roots of terms in A065611.
- a(n) = floor(log(n)*2^n/n).A065613
a(n) = floor(log(n)*2^n/n).
- a(n) = round(log(n)*2^n/n).A065614
a(n) = round(log(n)*2^n/n).
- a(n) = ceiling(log(n)*2^n/n).A065615
a(n) = ceiling(log(n)*2^n/n).
- a(n) = floor(log_2(n)*2^n/n).A065616
a(n) = floor(log_2(n)*2^n/n).
- a(n) = round(log_2(n)*2^n/n).A065617
a(n) = round(log_2(n)*2^n/n).
- a(n) = ceiling(log_2(n)*2^n/n).A065618
a(n) = ceiling(log_2(n)*2^n/n).
- Expansion of e.g.f. x * (tan(x) + sec(x)).A065619
Expansion of e.g.f. x * (tan(x) + sec(x)).
- a(0)=0; thereafter a(2n) = 2a(n), a(2n+1) = -2a(n) + 1.A065620
a(0)=0; thereafter a(2n) = 2a(n), a(2n+1) = -2a(n) + 1.
- Reversing binary representation of n. Converting sum of powers of 2 in binary representation of a(n) to alternating sum gives n.A065621
Reversing binary representation of n. Converting sum of powers of 2 in binary representation of a(n) to alternating sum gives n.
- Numerator of 1 - (3/4)^n - frac((3/2)^n), where frac(x) = x - floor(x).A065622
Numerator of 1 - (3/4)^n - frac((3/2)^n), where frac(x) = x - floor(x).
- a(n) = floor(abs(cos(n)/cos(2n))).A065623
a(n) = floor(abs(cos(n)/cos(2n))).
- Smallest m such that A065623(m) = n.A065624
Smallest m such that A065623(m) = n.
- Table of permutations of N, each row being a generator of the "rotation group" of infinite planar binary tree. Inverse generators are given in A065626.A065625
Table of permutations of N, each row being a generator of the "rotation group" of infinite planar binary tree. Inverse generators are given in A065626.
- Table of permutations of N, each row being a generator of the "rotation group" of infinite planar binary tree. Inverse generators are given in A065625.A065626
Table of permutations of N, each row being a generator of the "rotation group" of infinite planar binary tree. Inverse generators are given in A065625.
- Permutation of N induced by rotating the node 2 right in the infinite planar binary tree. The second row of A065625. Inverse of A065628.A065627
Permutation of N induced by rotating the node 2 right in the infinite planar binary tree. The second row of A065625. Inverse of A065628.
- Permutation of N induced by rotating the node 2 left in the infinite planar binary tree. The second row of A065626. Inverse of A065627.A065628
Permutation of N induced by rotating the node 2 left in the infinite planar binary tree. The second row of A065626. Inverse of A065627.
- Permutation of N induced by rotating the node 3 right in the infinite planar binary tree. The third row of A065625. Inverse of A065630.A065629
Permutation of N induced by rotating the node 3 right in the infinite planar binary tree. The third row of A065625. Inverse of A065630.
- Permutation of N induced by rotating the node 3 left in the infinite planar binary tree. The third row of A065626. Inverse of A065629.A065630
Permutation of N induced by rotating the node 3 left in the infinite planar binary tree. The third row of A065626. Inverse of A065629.
- Permutation of N induced by rotating the node 4 right in the infinite planar binary tree. The fourth row of A065625. Inverse of A065632.A065631
Permutation of N induced by rotating the node 4 right in the infinite planar binary tree. The fourth row of A065625. Inverse of A065632.
- Permutation of N induced by rotating the node 4 left in the infinite planar binary tree. The fourth row of A065626. Inverse of A065631.A065632
Permutation of N induced by rotating the node 4 left in the infinite planar binary tree. The fourth row of A065626. Inverse of A065631.
- Permutation of N induced by rotating the node 5 right in the infinite planar binary tree. The fifth row of A065625. Inverse of A065634.A065633
Permutation of N induced by rotating the node 5 right in the infinite planar binary tree. The fifth row of A065625. Inverse of A065634.
- Permutation of N induced by rotating the node 5 left in the infinite planar binary tree. The fifth row of A065626. Inverse of A065633.A065634
Permutation of N induced by rotating the node 5 left in the infinite planar binary tree. The fifth row of A065626. Inverse of A065633.
- Permutation of N induced by rotating the node 6 right in the infinite planar binary tree. The sixth row of A065625. Inverse of A065636.A065635
Permutation of N induced by rotating the node 6 right in the infinite planar binary tree. The sixth row of A065625. Inverse of A065636.
- Permutation of N induced by rotating the node 6 left in the infinite planar binary tree. The sixth row of A065626. Inverse of A065635.A065636
Permutation of N induced by rotating the node 6 left in the infinite planar binary tree. The sixth row of A065626. Inverse of A065635.
- Permutation of N induced by rotating the node 7 right in the infinite planar binary tree. The seventh row of A065625. Inverse of A065638.A065637
Permutation of N induced by rotating the node 7 right in the infinite planar binary tree. The seventh row of A065625. Inverse of A065638.
- Permutation of N induced by rotating the node 7 left in the infinite planar binary tree. The seventh row of A065626. Inverse of A065637.A065638
Permutation of N induced by rotating the node 7 left in the infinite planar binary tree. The seventh row of A065626. Inverse of A065637.
- Permutation of N induced by rotating the node 8 right in the infinite planar binary tree. The eighth row of A065625. Inverse of A065640.A065639
Permutation of N induced by rotating the node 8 right in the infinite planar binary tree. The eighth row of A065625. Inverse of A065640.
- Permutation of N induced by rotating the node 8 left in the infinite planar binary tree. The eighth row of A065626. Inverse of A065639.A065640
Permutation of N induced by rotating the node 8 left in the infinite planar binary tree. The eighth row of A065626. Inverse of A065639.
- Smallest number with persistence n for the sort-and-subtract-sequence.A065641
Smallest number with persistence n for the sort-and-subtract-sequence.
- a(1) = 1; for n > 1, a(n) = Min {m > n | m has same prime factors as n ignoring multiplicity}.A065642
a(1) = 1; for n > 1, a(n) = Min {m > n | m has same prime factors as n ignoring multiplicity}.
- Smallest integer value > 1 of the form floor((3/2)^k)/floor((3/2)^n).A065643
Smallest integer value > 1 of the form floor((3/2)^k)/floor((3/2)^n).
- a(n) is the smallest integer k such that floor((3/2)^k)/floor((3/2)^n) is an integer greater than 1.A065644
a(n) is the smallest integer k such that floor((3/2)^k)/floor((3/2)^n) is an integer greater than 1.
- Continued fraction for twin prime constant.A065645
Continued fraction for twin prime constant.
- Denominators of convergents to twin prime constant.A065646
Denominators of convergents to twin prime constant.
- Numerators of convergents to twin prime constant.A065647
Numerators of convergents to twin prime constant.
- a(0) = 1 and for n > 0: a(n) = number of indices 0 <= i <= n with A033307(i)=A033307(n), where A033307 is the sequence of decimal digits of Champernowne's constant 0.123456789101112131415...A065648
a(0) = 1 and for n > 0: a(n) = number of indices 0 <= i <= n with A033307(i)=A033307(n), where A033307 is the sequence of decimal digits of Champernowne's constant 0.123456789101112131415...
- Permutation of nonnegative integers based on Champernowne's constant 0.123456789101112131415...A065649
Permutation of nonnegative integers based on Champernowne's constant 0.123456789101112131415...
- Inverse permutation to A065649.A065650
Inverse permutation to A065649.
- a(n) = Sum_{k=1..n} (-1)^tau(k) = n - 2*floor(sqrt(n)).A065651
a(n) = Sum_{k=1..n} (-1)^tau(k) = n - 2*floor(sqrt(n)).
- a(0) = 0 and a(n+1) = if a(n) - 1 is new and > 0 then a(n) - 1 else a(n)*a(n) + 1 for n >= 0.A065652
a(0) = 0 and a(n+1) = if a(n) - 1 is new and > 0 then a(n) - 1 else a(n)*a(n) + 1 for n >= 0.
- a(0) = 0, a(1) = 1, a(n) = a(n-2)*a(n-2) + 2 for n > 1.A065653
a(0) = 0, a(1) = 1, a(n) = a(n-2)*a(n-2) + 2 for n > 1.
- Fixed points for A065652, a permutation of the natural numbers.A065654
Fixed points for A065652, a permutation of the natural numbers.
- Composite numbers k such that sigma(k)*(phi(k) + 2) is a square.A065655
Composite numbers k such that sigma(k)*(phi(k) + 2) is a square.
- Composite numbers k such that sigma(k)*phi(k) + 2*(k+1) is a square.A065656
Composite numbers k such that sigma(k)*phi(k) + 2*(k+1) is a square.
- Numbers m that minimize | k / EulerPhi(k) - golden ratio phi | when k runs over all the numbers with the same number of digits as m.A065657
Numbers m that minimize | k / EulerPhi(k) - golden ratio phi | when k runs over all the numbers with the same number of digits as m.
- The table of permutations of N, each row induced by the rotation (to the right) of the n-th node in the infinite binary "decimal" fraction tree.A065658
The table of permutations of N, each row induced by the rotation (to the right) of the n-th node in the infinite binary "decimal" fraction tree.
- The table of permutations of N, each row induced by the rotation (to the left) of the n-th node in the infinite binary "decimal" fraction tree.A065659
The table of permutations of N, each row induced by the rotation (to the left) of the n-th node in the infinite binary "decimal" fraction tree.
- Permutation of N induced by rotating the node 1 (the top node) right in the infinite planar binary tree shown at A065658.A065660
Permutation of N induced by rotating the node 1 (the top node) right in the infinite planar binary tree shown at A065658.