login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A016825 Numbers congruent to 2 mod 4: a(n) = 4n+2. 69
2, 6, 10, 14, 18, 22, 26, 30, 34, 38, 42, 46, 50, 54, 58, 62, 66, 70, 74, 78, 82, 86, 90, 94, 98, 102, 106, 110, 114, 118, 122, 126, 130, 134, 138, 142, 146, 150, 154, 158, 162, 166, 170, 174, 178, 182, 186, 190, 194, 198, 202, 206, 210, 214, 218, 222, 226, 230, 234 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

COMMENTS

Twice the odd numbers, also called singly even numbers.

Numbers having equal numbers of odd and even divisors: A001227(a(n))=A000005(2*a(n)). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Dec 28 2003

Continued fraction for coth(1/2) = (e+1)/(e-1). The continued fraction for tanh(1/2) = (e-1)/(e+1) would be a(0) = 0, a(n) = A016825(n-1), n >= 1.

No solutions to a(n)=b^2-c^2 - Henry Bottomley (se16(AT)btinternet.com), Jan 13 2001

Apart from initial term(s), dimension of the space of weight 2n cuspidal newforms for Gamma_0( 70 ).

Sequence gives n such that 8 is the largest power of 2 dividing A003629(k)^n-1 for any k - Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 05 2002

n such that sum(d|n,(-1)^d)=A048272(n)=0 - Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 15 2002

Also n such that sum(d|n,phi(d)*mu(n/d))=A007431(n)=0 - Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 15 2002

Also n such that sum(d|n,(d/A00005(d))*mu(n/d))=0, n such that sum(d|n,(A00005(d)/d)*mu(n/d))=0 - Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 19 2002

Solutions to phi[x]=phi[x/2]; primorial numbers are here. - Labos E. (labos(AT)ana.sote.hu), Dec 16 2002

Together with 1, numbers that are not the leg of a primitive Pythagorean triangle. - Lekraj Beedassy (blekraj(AT)yahoo.com), Nov 25 2003

Maximum number of electrons in an atomic subshell with orbital quantum number l is 2(2l+1) since the magnetic quantum number m goes from -l to +l and the electron spin is either -1/2 or +1/2 for each m.

For n>0: complement of A107750 and A023416(a(n)-1)=A023416(a(n))<>A023416(a(n)+1). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 23 2005

Also the minimal value of sum([p(i)-p(i+1)]^2, i=1..n+2), where p(n+3)=p(1), as p ranges over all permutations of {1,2,...,n+2} (see the Mihai reference). Example: a(2)=10 because the values of the sum for the permutations of {1,2,3,4}are 10 (8 times), 12 (8 times) and 18 (8 times). - Emeric Deutsch (deutsch(AT)duke.poly.edu), Jul 30 2005

Except for a(n)=2, numbers having 4 as an anti-divisor. - Alexandre Wajnberg (alexandre.wajnberg(AT)skynet.be), Oct 02 2005

This is also the number of polyacenes in carbon nanotubes. See page 413 equation 12 of the paper by I. Lukovits and D. Janezic. - Parthasarathy Nambi (PachaNambi(AT)yahoo.com), Aug 22 2006

A139391(a(n)) = A006370(a(n)) = A005408(n). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 17 2008

Also a(n) = (n-1) + n + (n+1) + (n+2), so a(n) and -a(n) are all the integers that are sums of four consecutive integers. [From Rick L. Shepherd (rshepherd2(AT)hotmail.com), Mar 21 2009]

(e-1)/(e+1) = tanh(1/2) [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), May 09 2009]

The denominator in pi/8 = (1/2)-(1/6)+(1/10)-(1/14)+(1/18)-(1/22)+.... - Mohammad K. Azarian, Oct 13 2011

REFERENCES

Mohammad K. Azarian, Problem 1218, Pi Mu Epsilon Journal, Vol. 13, No. 2, Spring 2010, p. 116.  Solution published in Vol. 13, No. 3, Fall 2010, pp. 183-185.

H. Bass, Mathematics, Mathematicians and Mathematics Education, Bull. Amer. Math. Soc. (N.S.) 42 (2004), no. 4, 417-430.

A. Beiser, Concepts of Modern Physics, 2nd Ed., McGraw-Hill, 1973.

J. R. Goldman, The Queen of Mathematics, 1998, p. 70.

Granino A. Korn and Theresa M.Korn, Mathematical Handbook for Scientists and Engineers, McGraw-Hill Book Company, New York (1968).

I. Lukovits and D. Janezic, "Enumeration of conjugated circuits in nanotubes", J. Chem. Inf. Comput. Sci., vol. 44, 410-414 (2004).

V. Mihai, Problem 10725, Amer. Math. Monthly, 108 (March 2001), pp. 272-273.

LINKS

Harry J. Smith, Table of n, a(n) for n = 0..20000

Index entries for sequences related to linear recurrences with constant coefficients

Tanya Khovanova, Recursive Sequences

William A. Stein, Dimensions of the spaces S_k^{new}(Gamma_0(N))

William A. Stein, The modular forms database

Eric Weisstein's World of Mathematics, Singly Even Number

Eric Weisstein's World of Mathematics, Square Number

G. Xiao, Contfrac

Index entries for continued fractions for constants

Number of electrons per filled orbital

FORMULA

a(n)=2*A005408(n) - Lekraj Beedassy (blekraj(AT)yahoo.com), Nov 28 2003

a(n) = A118413(n+1,2) for n>1. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 27 2006

G.f.: 2* (1+x)/(1-x)^2. E.g.f.: 2*(1+2*x)*exp(x). a(n)= a(n-1) + 4. a(-1-n)= -a(n). - Michael Somos Apr 11 2007

a(n) = 8*n-a(n-1) (with a(0)=2). [From Vincenzo Librandi, Nov 20 2010]

EXAMPLE

0.4621171572600097585023184... = 0 + 1/(2 + 1/(6 + 1/(10 + 1/(14 + ...))))

2.1639534137386528487700040... = 2 + 1/(6 + 1/(10 + 1/(14 + 1/(18 + ...)))), i.e. CF for coth(1/2)

MATHEMATICA

Range[2, 500, 4] (* From Vladimir Joseph Stephan Orlovsky (4vladimir(AT)gmail.com), May 26 2011 *)

PROG

(MAGMA) [4*n+2 : n in [0..100] ];

(PARI) {a(n)= 4*n+2}

(PARI) { allocatemem(932245000); default(realprecision, 180000); x=contfrac(tanh(1/2)); for (n=2, 20002, write("b016825.txt", n-2, " ", x[n])); } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), May 09 2009]

CROSSREFS

Cf. A107687. First differences of A001105.

Cf. A160327 = Decimal expansion.

Sequence in context: A111284 A130824 * A161718 A122905 A132417 A103747

Adjacent sequences:  A016822 A016823 A016824 * A016826 A016827 A016828

KEYWORD

nonn,easy,nice,cofr

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 13 06:53 EST 2012. Contains 205451 sequences.