A007310 -id:A007310 - cp's OEIS frontend

A175885 Numbers that are congruent to {1, 10} mod 11.

1, 10, 12, 21, 23, 32, 34, 43, 45, 54, 56, 65, 67, 76, 78, 87, 89, 98, 100, 109, 111, 120, 122, 131, 133, 142, 144, 153, 155, 164, 166, 175, 177, 186, 188, 197, 199, 208, 210, 219, 221, 230, 232, 241, 243, 252, 254, 263, 265, 274, 276, 285, 287, 296, 298

Offset: 1

Bruno Berselli, Oct 08 2010 - Nov 17 2010

Cf. property described by Gary Detlefs in A113801: more generally, these numbers are of the form (2*h*n + (h-4)*(-1)^n - h)/4 (h, n natural numbers), therefore ((2*h*n + (h-4)*(-1)^n - h)/4)^2 - 1 == 0 (mod h); in this case, a(n)^2 - 1 == 0 (mod 11).

Bruno Berselli, Table of n, a(n) for n = 1..10000.
Index entries for linear recurrences with constant coefficients, signature (1,1,-1).

Cf. A090771 (n==1 or 9 mod 10), A091998 (n==1 or 11 mod 12).
Cf. A195043 (partial sums).
Cf. A000217, A005408, A047209, A007310, A047336, A047522, A056020, A113801, A175886, A175887, A195312, A195313.

a175885 n = a175885_list !! (n-1)
a175885_list = 1 : 10 : map (+ 11) a175885_list
-- Reinhard Zumkeller, Jan 07 2012

[(22*n+7*(-1)^n-11)/4: n in [1..60]]; // Vincenzo Librandi, Sep 19 2011

Rest[Flatten[{#-1,#+1}&/@(11 Range[0,50])]] (* Harvey P. Dale, Nov 05 2010 *)

a(n)=n%2*9 + 1 \\ Charles R Greathouse IV, Aug 01 2016

G.f.: x*(1+9*x+x^2)/((1+x)*(1-x)^2).
a(n) = (22*n + 7*(-1)^n - 11)/4.
a(n) = -a(-n+1) = a(n-2) + 11 = a(n-1) + a(n-2) - a(n-3).
a(n) = 11*A000217(n-1) + 1 - 2*Sum_{i=1..n-1} a(i) for n > 1.
a(n) = A195312(n) + A195312(n-1) = A195313(n) - A195313(n-2). - Bruno Berselli, Sep 18 2011
Sum_{n>=1} (-1)^(n+1)/a(n) = (Pi/11)*cot(Pi/11). - Amiram Eldar, Dec 04 2021
E.g.f.: 1 + ((22*x - 11)*exp(x) + 7*exp(-x))/4. - David Lovler, Sep 04 2022
From Amiram Eldar, Nov 23 2024: (Start)
Product_{n>=1} (1 - (-1)^n/a(n)) = 2*cos(Pi/11).
Product_{n>=2} (1 + (-1)^n/a(n)) = (Pi/11)*cosec(Pi/11). (End)

A034828 a(n) = floor(n^2/4)*(n/2).

Original entry on oeis.org

0, 0, 1, 3, 8, 15, 27, 42, 64, 90, 125, 165, 216, 273, 343, 420, 512, 612, 729, 855, 1000, 1155, 1331, 1518, 1728, 1950, 2197, 2457, 2744, 3045, 3375, 3720, 4096, 4488, 4913, 5355, 5832, 6327, 6859, 7410, 8000, 8610, 9261, 9933, 10648, 11385, 12167, 12972, 13824

Offset: 0

N. J. A. Sloane

Wiener index of cycle of length n.

a(n+1) is the sum of labeled number of boxes arranged as pyramid with base n. The sum of boxes is A002620(n+1). See the illustration in links. - Kival Ngaokrajang, Jul 02 2013

			G.f.: x^2 + 3*x^3 + 8*x^4 + 15*x^5 + 27*x^6 + 42*x^7 + 64*x^8 + 90*x^9 + ...

T. D. Noe, Table of n, a(n) for n = 0..1000
M. Janjic and B. Petkovic, A Counting Function, arXiv 1301.4550 [math.CO], 2013.
Kival Ngaokrajang, Illustration for n = 1..10.
Eric Weisstein's World of Mathematics, Wiener Index.
H. J. Wiener, Structural Determination of Paraffin Boiling Points, J. Amer. Chem. Soc. 69 (1947), 17-20.
J. Zerovnik, Szeged index of symmetric graphs, J. Chem. Inf. Comput. Sci., 39 (1999), 77-80.
Index entries for linear recurrences with constant coefficients, signature (2,1,-4,1,2,-1).

Equals A005996/2.
Partial sums of A001318.
Cf. A107231.
Cf. A000578, A000330, A002620.
Cf. A002620, A007310.
Cf. A062717.

[Floor(n^2/4)*(n/2): n in [0..50]]; // G. C. Greubel, Feb 23 2018

A034828:=n->n*floor(n^2/4)/2; seq(A034828(k), k=0..100); # Wesley Ivan Hurt, Nov 05 2013

Table[Floor[n^2/4] n/2, {n, 0, 50}] (* Harvey P. Dale, Jun 10 2011 *)
LinearRecurrence[{2, 1, -4, 1, 2, -1}, {0, 0, 1, 3, 8, 15}, 50] (* Harvey P. Dale, Jun 10 2011 *)

{a(n) = (n^2 \ 4) * n / 2} /* Michael Somos, Sep 06 2008 */

{a(n) = if( n<0, -a(-n), polcoeff( x^2 * (1 + x + x^2) / ((1 - x)^2 * (1 - x^2)^2) + x * O(x^n), n))} /* Michael Somos, Sep 06 2008 */

a(n) = (n^2-1)*n/8 if n is odd, otherwise n^3/8.
From Paul Barry, May 13 2005: (Start)
G.f.: x^2*(1+x+x^2)/((1-x)^2*(1-x^2)^2).
a(n) = 2*a(n-1) +a(n-2) -4*a(n-3) +a(n-4) +2*a(n-5) -a(n-6).
a(n) = (2*n^3 +12*n^2 +23*n +14)/16 +(n+2)*(-1)^n/16.
a(n) = Sum_{k=0..floor((n+2)/2)} ((n+2)/(n+2-k))(-1)^k*C(n+2-k, k)* C(n-2*k+2, 2)*C(n-2*k, floor((n-2*k)/2)). [Typo corrected by R. J. Mathar, Aug 18 2008] (End)
a(n) = (2*n^2 - 1 + (-1)^n) * n / 16. - Michael Somos, Sep 06 2008
Euler transform of length 3 sequence [3, 2, -1]. - Michael Somos, Sep 06 2008
a(-n) = -a(n). - Michael Somos, Sep 06 2008
a(2n) = A000578(n). a(2n+1) = 3*A000330(n). a(n) = n*A002620(n)/2. - Michael Somos, Sep 06 2008
a(n) = (-n + Sum_{k=1..n} A007310(k)^2)/24. - Jesko Matthes, Feb 19 2021
Sum_{n>=2} 1/a(n) = 6 - 8*log(2) + zeta(3). - Amiram Eldar, Apr 16 2022
a(n) = Sum_{k=1..n} A062717(k)/4. - Sela Fried, Jun 27 2022

Definition reworded by Michael Somos, Sep 06 2008

A100044 Decimal expansion of Pi^2/9.

Original entry on oeis.org

1, 0, 9, 6, 6, 2, 2, 7, 1, 1, 2, 3, 2, 1, 5, 0, 9, 5, 7, 6, 4, 8, 2, 7, 6, 7, 7, 7, 7, 6, 4, 0, 1, 6, 7, 9, 2, 8, 1, 2, 6, 3, 3, 2, 6, 7, 4, 7, 1, 1, 9, 8, 9, 5, 8, 4, 9, 0, 3, 7, 2, 1, 5, 2, 9, 1, 3, 3, 3, 8, 3, 1, 3, 6, 0, 2, 1, 3, 3, 9, 1, 5, 8, 8, 9, 0, 8, 5, 9, 3, 3, 7, 4, 6, 5, 0, 5, 8, 0, 3, 5, 3

Offset: 1

Eric W. Weisstein, Oct 31 2004

The Dirichlet L-series for the principal character mod 6 (which is A120325 shifted left) evaluated at 2. - R. J. Mathar, Jul 20 2012

Equals the asymptotic mean of the abundancy index of the numbers coprime to 6 (A007310). - Amiram Eldar, May 12 2023

			1.096622711232150957648276777764...

F. Aubonnet, D. Guinin, and B.Joppin, Précis de Mathématiques, Analyse 2, Classes Préparatoires, Premier Cycle Universitaire, Bréal, 1990, Exercice 908, pages 82 and 91-92.
L. B. W. Jolley, Summation of Series, Dover, 1961.

G. C. Greubel, Table of n, a(n) for n = 1..5000
Jean-Paul Allouche and Jeffrey Shallit, Sums of digits and the Hurwitz zeta function, in: K. Nagasaka and E. Fouvry (eds.), Analytic Number Theory, Lecture Notes in Mathematics, Vol. 1434, Springer, Berlin, Heidelberg, 1990, pp. 19-30.
Eugène-Charles Catalan, Mémoire sur la transformation des séries et sur quelques intégrales définies, Mémoires de l'Académie royale de Belgique, 1867, Vol. 33, pp. 1-50.
R. J. Mathar, Table of Dirichlet L-series and prime zeta modulo functions for small moduli, arXiv:1008.2547 [math.NT], 2010-2015, Table 22.
Eric Weisstein's World of Mathematics, Digit Sum.
Index entries for transcendental numbers.

Cf. A000120, A007310, A008833, A019670, A086463, A091999, A104777, A120325, A112093, A112094, A130549, A130550.

RealDigits[Pi^2/9, 10, 110][[1]] (* G. C. Greubel, Feb 17 2017 *)

default(realprecision, 110); Pi^2/9 \\ G. C. Greubel, Feb 17 2017

numerical_approx(pi^2/9, digits=120) # G. C. Greubel, Jun 02 2021

Equals 1 + (1/2)*(1/3)*(1/2) + (1/3)*(1*2)/(3*5)*(1/2)^2 + (1/4) *(1*2*3)/(3*5*7)*(1/2)^3 + .... [Jolley eq 277]
Equals 1/1^2 + 1/5^2 + 1/7^2 + 1/11^2 + 1/13^2 + 1/17^2 + .... - R. J. Mathar, Jul 20 2012
Equals 2*Sum_{n>=1} 1/(6*n*(3*n + (-1)^n - 3) - 3*(-1)^n + 5) = 2*Sum_{n>=1} 1/(2*A104777(n)). - Alexander R. Povolotsky, May 18 2014
Equals A019670^2. - Michel Marcus, May 19 2014
Equals 2*A086463 = 2*Sum_{n>=1} 1/A091999(n)^2, equivalent to the formula of 2012 above. - Alexander R. Povolotsky, May 20 2014
Equals 3F2(1,1,1; 3/2,2 ; 1/4), following from Clausen's formula of J. Reine Angew. Math 3 (1828) for squares of 2F1() as noted in A019670. - R. J. Mathar, Oct 16 2015
Equals Product_{n >= 3} prime(n)^2 / (prime(n)^2 - 1), Euler's prime product, excluding first two primes. - Fred Daniel Kline, Jun 09 2016
Equals Integral_{x=0..oo} log(x)/(x^6 - 1) dx. - Amiram Eldar, Aug 12 2020
Equals Sum_{k>=1} A000120(k) * (2*k+1)/(k^2*(k+1)^2) (Allouche and Shallit, 1990). - Amiram Eldar, Jun 01 2021
Equals Integral_{x=0..1} log(1+x+x^2)/x dx (Aubonnet). - Bernard Schott, Feb 04 2022
Equals Sum_{k>=1} A008833(k)/k^4. - Amiram Eldar, Jan 25 2024
Continued fraction expansion: 1/(1 - 1/(13 - 48/(34 - 270/(65 - ... - 2*(2*n-1)*n^3/((5*n^2+6*n+2) - ... ))))). See A130549. - Peter Bala, Feb 16 2024
Equals Sum_{k >= 0} 1/((k + 1)*(2*k + 1)*binomial(2*k, k)). See Catalan, Section 21, equation 30. - Peter Bala, Aug 14 2024

A254051 Square array A by downward antidiagonals: A(n,k) = (3 + 3^n(2floor(3*k/2) - 1))/6, n,k >= 1; read as A(1,1), A(1,2), A(2,1), A(1,3), A(2,2), A(3,1), ...

Original entry on oeis.org

1, 3, 2, 4, 8, 5, 6, 11, 23, 14, 7, 17, 32, 68, 41, 9, 20, 50, 95, 203, 122, 10, 26, 59, 149, 284, 608, 365, 12, 29, 77, 176, 446, 851, 1823, 1094, 13, 35, 86, 230, 527, 1337, 2552, 5468, 3281, 15, 38, 104, 257, 689, 1580, 4010, 7655, 16403, 9842, 16, 44, 113, 311, 770, 2066, 4739, 12029, 22964, 49208, 29525, 18, 47

Offset: 1

L. Edson Jeffery & Antti Karttunen, Jan 24 2015

This is transposed dispersion of (3n-1), starting from its complement A032766 as the first row of square array A(row,col). Please see the transposed array A191450 for references and background discussion about dispersions.

For any odd number x = A135765(row,col), the result after one combined Collatz step (3x+1)/2 -> x (A165355) is found in this array at A(row+1,col).

			The top left corner of the array:
   1,   3,   4,   6,   7,   9,  10,  12,   13,   15,   16,   18,   19,   21
   2,   8,  11,  17,  20,  26,  29,  35,   38,   44,   47,   53,   56,   62
   5,  23,  32,  50,  59,  77,  86, 104,  113,  131,  140,  158,  167,  185
  14,  68,  95, 149, 176, 230, 257, 311,  338,  392,  419,  473,  500,  554
  41, 203, 284, 446, 527, 689, 770, 932, 1013, 1175, 1256, 1418, 1499, 1661
...

Inverse: A254052.
Transpose: A191450.
Row 1: A032766.
Cf. A007051, A057198, A199109, A199113 (columns 1-4).
Cf. A254046 (row index of n in this array, see also A253786), A253887 (column index).
Array A135765(n,k) = 2*A(n,k) - 1.
Other related arrays: A254055, A254101, A254102.
Cf. also A000079, A000244, A003961, A007310, A032766, A002260, A004736, A038722, A165355, A254050.
Related permutations: A048673, A254053, A183209, A249745, A254103, A254104.

In A(n,k)-formulas below, n is the row, and k the column index, both starting from 1:
A(n,k) = (3 + ( A000244(n) * (2*A032766(k) - 1) )) / 6. - Antti Karttunen after L. Edson Jeffery's direct formula for A191450, Jan 24 2015
A(n,k) = A048673(A254053(n,k)). [Alternative formula.]
A(n,k) = (1/2) * (1 + A003961((2^(n-1)) * A254050(k))). [The above expands to this.]
A(n,k) = (1/2) * (1 + (A000244(n-1) * A007310(k))). [Which further reduces to this, equivalent to L. Edson Jeffery's original formula above.]
A(1,k) = A032766(k) and for n > 1: A(n,k) = (3 * A254051(n-1,k)) - 1. [The definition of transposed dispersion of (3n-1).]
A(n,k) = (1+A135765(n,k))/2, or when expressed one-dimensionally, a(n) = (1+A135765(n))/2.
A(n+1,k) = A165355(A135765(n,k)).
As a composition of related permutations. All sequences interpreted as one-dimensional:
a(n) = A048673(A254053(n)). [Proved above.]
a(n) = A191450(A038722(n)). [Transpose of array A191450.]

A255407 Permutation of natural numbers: a(n) = A255127(A252460(n)).

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 23, 20, 21, 22, 25, 24, 19, 26, 27, 28, 29, 30, 37, 32, 33, 34, 35, 36, 41, 38, 39, 40, 43, 42, 47, 44, 45, 46, 53, 48, 31, 50, 51, 52, 61, 54, 49, 56, 57, 58, 67, 60, 71, 62, 63, 64, 65, 66, 77, 68, 69, 70, 83, 72, 89, 74, 75, 76, 59, 78, 91, 80, 81

Offset: 1

Antti Karttunen, Feb 22 2015

nonn

a(n) tells which number in Ludic array A255127 is at the same position where n is in array A083221, the sieve of Eratosthenes. As both arrays have A005843 (even numbers) and A016945 as their two topmost rows, both sequences are among the fixed points of this permutation.

Equally: a(n) tells which number in array A255129 is at the same position where n is in the array A083140, as they are the transposes of above two arrays.

			A083221(8,1) = 19 and A255127(8,1) = 23, thus a(19) = 23.
A083221(9,1) = 23 and A255127(9,1) = 25, thus a(23) = 25.
A083221(3,2) = 25 and A255127(3,2) = 19, thus a(25) = 19.

Antti Karttunen, Table of n, a(n) for n = 1..8192
Index entries for sequences that are permutations of the natural numbers

Cf. A001248, A003309, A007310, A008578, A083221, A084967, A252460, A254100, A255413, A255127.
Inverse: A255408.
Similar permutations: A249818.

a(n) = A255127(A252460(n)).
Other identities. For all n >= 1:
a(2n) = 2n. [Fixes even numbers.]
a(3n) = 3n. [Fixes multiples of three.]
a(A008578(n)) = A003309(n). [Maps noncomposites to Ludic numbers.]
a(A001248(n)) = A254100(n). [Maps squares of primes to "postludic numbers".]
a(A084967(n)) = a(5*A007310(n)) = A007310((5*n)-3) = A255413(n). [Maps A084967 to A255413.]
(And similarly between other columns and rows of A083221 and A255127.)

A047229 Numbers that are congruent to {0, 2, 3, 4} mod 6.

Original entry on oeis.org

0, 2, 3, 4, 6, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 22, 24, 26, 27, 28, 30, 32, 33, 34, 36, 38, 39, 40, 42, 44, 45, 46, 48, 50, 51, 52, 54, 56, 57, 58, 60, 62, 63, 64, 66, 68, 69, 70, 72, 74, 75, 76, 78, 80, 81, 82, 84

Offset: 1

N. J. A. Sloane

Appears to be the sequence of n such that n never divides 3^x-2^x for x>=0. - Benoit Cloitre, Aug 19 2002
Numbers divisible by 2 or 3. - Nick Hobson, Mar 13 2007
Numbers k such that average of squares of the first k positive integers is not integer. A089128(a(n)) > 1. For n >= 2, a(n) = complement of A007310. - Jaroslav Krizek, May 28 2010
Numbers k such that k*Fibonacci(k) is even. - Gary Detlefs, Oct 27 2011
Also numbers that have a divisor d with 2^1 <= d < 2^2 (see Ei definition p. 340 in Besicovitch article). - Michel Marcus, Oct 31 2013
Starting with 0, 2, a(n) is the smallest number greater than a(n-1) that is not relatively prime to a(n-2). - Franklin T. Adams-Watters, Dec 04 2014

Vincenzo Librandi, Table of n, a(n) for n = 1..10000
A. S. Besicovitch, On the density of certain sequences of integers, Mathematische Annalen, Vol. 110, No. 1 (1935), pp. 336-341; alternative link.
Hsien-Kuei Hwang, Svante Janson and Tsung-Hsi Tsai, Exact and Asymptotic Solutions of a Divide-and-Conquer Recurrence Dividing at Half: Theory and Applications, ACM Transactions on Algorithms, Vol. 13, No. 4 (2017), Article #47; ResearchGate link; preprint, 2016.
Index entries for linear recurrences with constant coefficients, signature (2,-2,2,-1)

Cf. A007310 (complement).

Union of A005843 and A008585.

a047229 n = a047229_list !! (n-1)
a047229_list = filter ((`notElem` [1,5]) . (`mod` 6)) [0..]
-- Reinhard Zumkeller, Jun 30 2012

[ n : n in [0..150] | n mod 6 in [0, 2, 3, 4]] ; // Vincenzo Librandi, Jun 01 2011

Select[Range[0,100],MemberQ[{0,2,3,4},Mod[#,6]]&] (* Harvey P. Dale, Aug 15 2011 *)
a[ n_] := With[ {m = n - 1}, {2, 3, 4, 0}[[Mod[m, 4, 1]]] + Quotient[ m, 4] 6]; (* Michael Somos, Oct 05 2015 *)

a(n)=(n-1)\4*6+[4,0,2,3][n%4+1] \\ Charles R Greathouse IV, Oct 28 2011

def A047229(n): return 3*(n-1>>1&-2)+(4,0,2,3)[n&3] # Chai Wah Wu, Nov 18 2024

a(n) = (6*(n-1) - (1+(-1)^n)*(-1)^(n*(1+(-1)^n)/4))/4; also a(n) = (6*(n-1) - (-i)^n - i^n)/4, where i is the imaginary unit. - Bruno Berselli, Nov 08 2010
G.f.: x^2*(2-x+2*x^2) / ( (x^2+1)*(x-1)^2 ). - R. J. Mathar, Oct 08 2011
a(n) = floor((6*n-5)/4) + floor((1/2)*cos((n+2)*Pi/2) + 1/2). - Gary Detlefs, Oct 28 2011 and corrected by Aleksey A. Solomein, Feb 08 2016
a(n) = a(n-1) + a(n-4) - a(n-5), n>4. - Gionata Neri, Apr 15 2015
a(n) = -a(2-n) for all n in Z. - Michael Somos, Oct 05 2015
a(n) = n + 2*floor((n-2)/4) + floor(f(n+2)/3), where f(n) = n mod 4. - Aleksey A. Solomein, Feb 08 2016
a(n) = (3*n - 3 - cos(n*Pi/2))/2. - Wesley Ivan Hurt, Oct 02 2017
Equals {0} union {A003586(j) * A007310(k) for j>1 and k>0}. - Flávio V. Fernandes, Jul 21 2021
Sum_{n>=2} (-1)^n/a(n) = log(3)/2 - log(2)/3. - Amiram Eldar, Dec 12 2021

A002114 Glaisher's H' numbers.

Original entry on oeis.org

1, 11, 301, 15371, 1261501, 151846331, 25201039501, 5515342166891, 1538993024478301, 533289474412481051, 224671379367784281901, 113091403397683832932811, 67032545884354589043714301, 46211522130188693681603906171

Offset: 1

N. J. A. Sloane

a(n) mod 9 = 1,2,4,8,7,5 repeated period 6 (A153130, see also A001370). a(n) mod 10 = 1. - Paul Curtz, Sep 10 2009

A. Fletcher, J. C. P. Miller, L. Rosenhead and L. J. Comrie, An Index of Mathematical Tables. Vols. 1 and 2, 2nd ed., Blackwell, Oxford and Addison-Wesley, Reading, MA, 1962, Vol. 1, p. 76.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Vincenzo Librandi, Table of n, a(n) for n = 1..100
J. W. L. Glaisher, On a set of coefficients analogous to the Eulerian numbers, Proc. London Math. Soc., 31 (1899), 216-235.
Vladimir Kruchinin, Composition of ordinary generating functions, arXiv:1009.2565 [math.CO], 2010. [Author's named corrected by _N. J. A. Sloane_, Dec 12 2021]
Index entries for sequences related to Glaisher's numbers

a := n -> (-1)^n*6^(2*n)*(Zeta(0,-n*2,1/3)-Zeta(0,-n*2, 5/6)):
seq(a(n), n=1..14);

Select[Rest[With[{nn=28},CoefficientList[Series[1/(2 (2Cos[x]-1)), {x,0,nn}], x]Range[0,nn]!]],#!=0&] (* Harvey P. Dale, Jul 27 2011 *)
FullSimplify[Table[(-1)^(s+1) * BernoulliB[2*s] * (Zeta[2*s + 1, 1/6] - Zeta[2*s + 1, 5/6]) / (4*Pi*Sqrt[3]*Zeta[2*s]), {s, 1, 20}]]  (* Vaclav Kotesovec, May 05 2020 *)

a(n) := sum(sum(binomial(k,j)*(-1)^(k-j+1)*1/2^(j-1)*sum((-1)^(n)*binomial(j,i)*(2*i-j)^(2*n),i,0,floor((j-1)/2)),j,0,k)*(-2)^(k-1),k,1,2*n); /* Vladimir Kruchinin, Aug 05 2010 */

H'(n) = H(n)/3, where H(n)=2^(2n+1)*I(n) (see A002112) and e.g.f. for (-1)^n*I(n) is (3/2)/(1+exp(x)+exp(-x)) (see A047788, A047789).
H'(n) = A000436(n)/2^(2n+1). - Philippe Deléham, Jan 17 2004
For n > 0, H'(n) = Sum{k = 0..n, T(n, k)*9^(n-k)*2^(k-1) }; where DELTA is the operator defined in A084938, T(n, k) is the triangle, read by rows, given by :[0, 1, 0, 4, 0, 9, 0, 16, 0, 25, ...] DELTA [1, 0, 10, 0, 28, 0, 55, 0, 90, ..]= {1}; {0, 1}; {0, 1, 1}; {0, 1, 12, 1}; {0, 1, 63, 123, 1}; {0, 1, 274, 2366, 1234, 1}; ... For 1, 10, 28, 55, 90, 136, ... see A060544 or A060544. - Philippe Deléham, Jan 17 2004
E.g.f. 1/2*1/(2*cos(x)-1). a(n)=sum(sum(binomial(k,j)*(-1)^(k-j+1)*1/2^(j-1)*sum((-1)^(n)*binomial(j,i)*(2*i-j)^(2*n),i,0,floor((j-1)/2)),j,0,k)*(-2)^(k-1),k,1,2*n), n>0. - Vladimir Kruchinin, Aug 05 2010
E.g.f.: E(x)= x^2/(G(0)-x^2) ; G(k)= 2*(2*k+1)*(k+1) - x^2 + 2*x^2*(2*k+1)*(k+1)/G(k+1); (continued fraction Euler's kind, 1-step ). - Sergei N. Gladkovskii, Jan 03 2012
If E(x)=Sum(k=0,1,..., a(k+1)*x^(2k+2)), then A002114(k) = a(k+1)*(2*k+2)!. - Sergei N. Gladkovskii, Jan 09 2012
a(n) ~ (2*n)! * 3^(2*n+1/2) / Pi^(2*n+1). - Vaclav Kotesovec, Feb 26 2014
a(n) = (-1)^n*6^(2*n)*(zeta(-n*2,1/3)-zeta(-n*2,5/6)), where zeta(a, z) is the generalized Riemann zeta function.
From Vaclav Kotesovec, May 05 2020: (Start)
a(n) = (2*n)! * (zeta(2*n+1, 1/6) - zeta(2*n+1, 5/6)) / (sqrt(3)*(2*Pi)^(2*n+1)).
a(n) = (-1)^(n+1) * Bernoulli(2*n) * (zeta(2*n+1, 1/6) - zeta(2*n+1, 5/6)) / (4*Pi*sqrt(3)*zeta(2*n)). (End)
Conjectural e.g.f.: Sum_{n >= 1} (-1)^n*Product_{k = 1..n} (1 - exp(A007310(k)*z) ) =  z + 11*z^2/2! + 301*z^3/3! + .... - Peter Bala, Dec 09 2021

A273669 Decimal representation ends with either 2 or 9.

Original entry on oeis.org

2, 9, 12, 19, 22, 29, 32, 39, 42, 49, 52, 59, 62, 69, 72, 79, 82, 89, 92, 99, 102, 109, 112, 119, 122, 129, 132, 139, 142, 149, 152, 159, 162, 169, 172, 179, 182, 189, 192, 199, 202, 209, 212, 219, 222, 229, 232, 239, 242, 249, 252, 259, 262, 269, 272, 279, 282, 289, 292, 299, 302, 309, 312, 319, 322, 329, 332, 339

Offset: 1

Antti Karttunen, Aug 06 2016

Natural numbers not in A273664.

Antti Karttunen, Table of n, a(n) for n = 1..10000
Index entries for linear recurrences with constant coefficients, signature(1,1,-1).

Sequences A017293 and A017377 interleaved.
Cf. A000035, A001622, A007310, A084967, A126760, A249745, A249746.
Cf. also A273664, A249824, A275716.

Select[Range@ 340, MemberQ[{2, 9}, Mod[#, 10]] &] (* or *)
Table[{10 n + 2, 10 n + 9}, {n, 0, 33}] // Flatten (* or *)
CoefficientList[Series[(-5/(1 - x) + (11 - x)/(-1 + x)^2 - 2/(1 + x))/2, {x, 0, 67}], x] (* Michael De Vlieger, Aug 07 2016 *)

(define (A273669 n) (+ (* 10 (/ (+ (- n 2) (if (odd? n) 1 0)) 2)) (if (odd? n) 2 9)))

a(n) = 10*(((n-2)+A000035(n))/2) + 2 [when n is odd], or + 9 [when n is even].
For n >= 5, a(n) = 2*a(n-2) - a(n-4).
a(n) = A126760(A084967(n)).
a(n) = A249746((3*A249745(n))-1).
Other identities. For all n >= 1:
A084967(n) = 5*A007310(n) = A007310(a(n)).
G.f.: x*(x^2+7*x+2)/((x+1)*(x-1)^2).
Sum_{n>=1} (-1)^(n+1)/a(n) = sqrt((1+1/sqrt(5))/2)*phi^2*Pi/10 - log(phi)/(2*sqrt(5)) - log(2)/5, where phi is the golden ratio (A001622). - Amiram Eldar, Apr 15 2023

A105397 Periodic with period 2: repeat [4,2].

Original entry on oeis.org

4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2

Offset: 0

Eric Angelini, May 01 2005

A simple "Fractal Jump Sequence" (FJS). An FJS is a sequence of digits containing an infinite number of copies of itself. Modus operandi: underline the first digit "a" of such a sequence then jump over the next "a" digits and underline the digit "b" on which you land. Jump from there over the next "b" digits and underline the digit "c" on which you land. Etc. The "abc...n..." succession of underlined digits is the sequence itself.

Simple continued fraction of 2+sqrt(6). - R. J. Mathar, Nov 21 2011

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

Cf. A010694 (period 2, repeat [2,4]).

First differences of A007310. - Fred Daniel Kline, Aug 17 2020

A105397:=n->3 + (-1)^n; seq(A105397(n), n=0..100); # Wesley Ivan Hurt, Mar 14 2014

Table[3 + (-1)^n, {n, 0, 100}] (* Wesley Ivan Hurt, Mar 14 2014 *)
LinearRecurrence[{0, 1},{4, 2},75] (* Ray Chandler, Aug 25 2015 *)

contfrac(2+sqrt(6)) \\ Michel Marcus, Mar 18 2014

a(n) = 3 + (-1)^n = 4 - 2*(n mod 2) = 2 * 2^((n+1) mod 2). - Wesley Ivan Hurt, Mar 14 2014

Edited by N. J. A. Sloane, Jun 08 2010

A249746 Permutation of natural numbers: a(n) = A126760(A249735(n)) = A249824(A064216(n)).

Original entry on oeis.org

1, 2, 3, 4, 9, 5, 6, 12, 7, 8, 19, 10, 17, 42, 11, 13, 22, 26, 14, 29, 15, 16, 59, 18, 41, 32, 20, 31, 39, 21, 23, 92, 40, 24, 49, 25, 27, 82, 48, 28, 209, 30, 45, 52, 33, 63, 62, 54, 34, 109, 35, 36, 129, 37, 38, 69, 43, 68, 142, 70, 57, 72, 115, 44, 79, 46, 85, 292, 47, 50, 89, 74, 73, 202, 51, 53, 159, 87, 55, 99, 107, 56, 152, 58, 97, 192, 60

Offset: 1

Antti Karttunen, Nov 23 2014

nonn

Permutation obtained from the odd bisection of A003961 (or from the odd bisection of A048673).

			a(5) = 9 because of the following. 2*A064216(5) = 2*4 = 8 = 2^3. We replace the prime factor 2 of 8 with the next prime 3 to get 3^3, then replace 3 with 5 to get 5^3 = 125. The smallest prime factor of 125 is 5. 125 is the 9th term of A084967: 5, 25, 35, 55, 65, 85, 95, 115, 125, ..., thus a(5) = 9.

Antti Karttunen, Table of n, a(n) for n = 1..10000
Index entries for sequences that are permutations of the natural numbers

Inverse: A249745.
Row 2 of A251722.
Cf. A003961, A007310, A048673, A084967, A126760, A249735, A064216, A249824.
Cf. also A273664, A273669.

t = PositionIndex[FactorInteger[#][[1, 1]] & /@ Range[10^6]]; f[n_] := Times @@ Power[If[# == 1, 1, NextPrime@ #] & /@ First@ #, Last@ #] &@ Transpose@ FactorInteger@ n; Flatten@ Map[Position[Lookup[t, FactorInteger[#][[1, 1]] ], #] &[f@ f[2 #]] &, Table[Times @@ Power[If[# == 1, 1, NextPrime[#, -1]] & /@ First@ #, Last@ #] &@ Transpose@ FactorInteger[2 n - 1], {n, 87}]] (* Michael De Vlieger, Jul 25 2016, Version 10 *)

(define (A249746 n) (define (Ainv_of_A007310off0 n) (+ (* 2 (floor->exact (/ n 6))) (/ (- (modulo n 6) 1) 4))) (+ 1 (Ainv_of_A007310off0 (A003961 (+ n n -1)))))

a(n) = 1 + f(A003961(2n - 1)), where f(n) = 2*floor[n/6] + ((n mod 6)-1)/4. [Here 1 + f(A007310(n)) = n.]
a(n) = A126760(A249735(n)). - Antti Karttunen, Jul 25 2016
As a composition of related permutations:
a(n) = A249824(A064216(n)).
Other identities. For all n >= 1:
A249735(n) = A007310(a(n)).
a(3n-1) = A273669(a(n)) and a(A254049(n)) = A273664(a(n)). - Antti Karttunen, Aug 07 2016

cp's OEIS Frontend

A175885 Numbers that are congruent to {1, 10} mod 11.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Magma

Mathematica

PARI

Formula

A034828 a(n) = floor(n^2/4)*(n/2).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

PARI

Formula

Extensions

A100044 Decimal expansion of Pi^2/9.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI

Sage

Formula

A254051 Square array A by downward antidiagonals: A(n,k) = (3 + 3^n*(2*floor(3*k/2) - 1))/6, n,k >= 1; read as A(1,1), A(1,2), A(2,1), A(1,3), A(2,2), A(3,1), ...

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A255407 Permutation of natural numbers: a(n) = A255127(A252460(n)).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A047229 Numbers that are congruent to {0, 2, 3, 4} mod 6.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Magma

Mathematica

PARI

Python

Formula

A002114 Glaisher's H' numbers.

Views

Author

Keywords

A254051 Square array A by downward antidiagonals: A(n,k) = (3 + 3^n(2floor(3*k/2) - 1))/6, n,k >= 1; read as A(1,1), A(1,2), A(2,1), A(1,3), A(2,2), A(3,1), ...