Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A016969
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A016969 6n+5. +0
21
5, 11, 17, 23, 29, 35, 41, 47, 53, 59, 65, 71, 77, 83, 89, 95, 101, 107, 113, 119, 125, 131, 137, 143, 149, 155, 161, 167, 173, 179, 185, 191, 197, 203, 209, 215, 221, 227, 233, 239, 245, 251, 257, 263, 269, 275, 281, 287, 293, 299, 305, 311, 317, 323, 329, 335 (list; graph; listen)
OFFSET

0,1

COMMENT

Apart from initial term(s), dimension of the space of weight 2n cusp forms for Gamma_0( 18 ).

Exponents e such that x^e+x-1 is reducible.

a(n) = A003415(A003415(A125200(n+1)))/2. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Nov 24 2006

A008615(a(n)) = n+1. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Feb 27 2008

First differences of A141631 (2, 7, 18) . Last digit is period 5:repeat 5, 1, 7, 3, 9, fifth quintuplet with A139788 (1, 7, 3, 9, 5) or A139788(n+4).Three other quintuplets are A139788(n+1)= 7, 3, 9, 5, 1, A139788(n+2)= 3, 9, 5, 1, 7 and A139788(n+3)= 9, 5, 1, 7, 3 (the five odd digits) . [From Paul Curtz (bpcrtz(AT)free.fr), Sep 12 2008]

a(n) = A016921(n)+4 = A016933(n)+3 = A016945(n)+2 = A016957(n)+1. [From Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Jan 04 2009]

A157176(a(n)) = A001018(n+1). [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Feb 24 2009]

LINKS

Tanya Khovanova, Recursive Sequences

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 949

William A. Stein, Dimensions of the spaces S_k(Gamma_0(N))

William A. Stein, The modular forms database

FORMULA

Contribution from Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Jan 04 2009: (Start)

G.f.: (5+x)/(1-x)^2.

a(0) = 5; for n > 0, a(n) = a(n-1)+6. (End)

MAPLE

a[1]:=-1:for n from 2 to 100 do a[n]:=a[n-1]+6 od: seq(a[n], n=2..47); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 16 2008

MATHEMATICA

f[n_]:=6*n+5; lst={}; Do[a=f[n]; AppendTo[lst, a], {n, 0, 6!}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Jun 25 2009]

PROGRAM

(MAGMA) [ 6*n+5: n in [0..55] ]; [From Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Jan 04 2009]

(Other) sage: [i+5 for i in range(338) if gcd(i, 6) == 6] # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), May 20 2009]

CROSSREFS

Cf. A111863.

Cf. A008588, A016921, A016933, A016945, A016957.

a(n)=A007310(2*n+1); complement of A016921 with respect to A007310. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 02 2008]

Sequence in context: A105644 A059538 A101328 this_sequence A007528 A144918 A144920

Adjacent sequences: A016966 A016967 A016968 this_sequence A016970 A016971 A016972

KEYWORD

nonn,easy

AUTHOR

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

EXTENSIONS

More terms from Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Jan 04 2009

page 1

Search completed in 0.003 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 22 15:28 EST 2009. Contains 167310 sequences.


AT&T Labs Research