Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A051340
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A051340 A simple 2-dimensional array, read by antidiagonals. +0
26
1, 1, 2, 1, 1, 3, 1, 1, 1, 4, 1, 1, 1, 1, 5, 1, 1, 1, 1, 1, 6, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 1, 8, 1, 1, 1, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 13, 1, 1, 1, 1, 1, 1 (list; table; graph; listen)
OFFSET

0,3

REFERENCES

A. V. Mikhalev and A. A. Nechaev, Linear recurring sequences over modules, Acta Applic. Math., 42 (1996), 161-202.

FORMULA

For n>0, a(n(n+3)/2)=n if k is not of form n*(n+3)/2 a(k)=1 - Benoit Cloitre (benoit7848c(AT)orange.fr), Oct 31 2002

CROSSREFS

Sequence in context: A080209 A127949 A167407 this_sequence A165430 A164823 A167269

Adjacent sequences: A051337 A051338 A051339 this_sequence A051341 A051342 A051343

KEYWORD

easy,nice,nonn,tabl

AUTHOR

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

page 1

Search completed in 0.002 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 25 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research