Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A016921
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A016921 6n+1. +0
45
1, 7, 13, 19, 25, 31, 37, 43, 49, 55, 61, 67, 73, 79, 85, 91, 97, 103, 109, 115, 121, 127, 133, 139, 145, 151, 157, 163, 169, 175, 181, 187, 193, 199, 205, 211, 217, 223, 229, 235, 241, 247, 253, 259, 265, 271, 277, 283, 289, 295, 301, 307, 313, 319, 325, 331 (list; graph; listen)
OFFSET

0,2

COMMENT

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

Also solutions to 2^x+3^x == 5 mod 7. - Cino Hilliard (hillcino368(AT)gmail.com), May 10 2003

Except for 1, exponents e such that x^e-x^2-1 is reducible.

Let M(n) be the n X n matrix m(i,j)=min(i,j) then the trace of M(n)^(-2) is a(n-1)=6*n-5 - Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 09 2006

If Y is a 3-subset of an (2n+1)-set X then, for n>=3, a(n-1) is the number of 3-subsets of X having at least two elements in common with Y. - Milan R. Janjic (agnus(AT)blic.net), Dec 16 2007

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

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

LINKS

Index entries for sequences related to linear recurrences with constant coefficients

Tanya Khovanova, Recursive Sequences

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

William A. Stein, The modular forms database

FORMULA

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

MAPLE

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

MATHEMATICA

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

PROGRAM

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

CROSSREFS

Cf. A093563 ((6, 1) Pascal, column m=1). A000567 (partial sums).

Cf. A008588, A016933, A016945, A016957, A016969.

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

A161700, A005408, A016813, A017281, A017533, A158057, A161705, A161709, A161714, A128470. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jun 17 2009]

Adjacent sequences: A016918 A016919 A016920 this_sequence A016922 A016923 A016924

Sequence in context: A059335 A070419 A080199 this_sequence A123843 A004082 A039281

KEYWORD

nonn,easy

AUTHOR

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

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 8 20:39 EST 2009. Contains 166234 sequences.


AT&T Labs Research